enhanced qc-ldpc codes

专利摘要:
a device determines a code block size (cbs) of information bits contained in a low density parity check coding code word (ldpc). the device compares the cbs with at least one limit, determines, based on the result of the comparison, a kb number and determines a kp number based on the code rate and the kb number. the device generates a parity check matrix. a portion of information from the parity check matrix is a first matrix formed by the number m of second square matrices. m is equal to kp multiplied by kb. a total number of columns in the kb number of second square arrays is equal to a total number of cbs bits. one or more matrices of the number m of second square matrices are circular permutation matrices. the device operates an ldpc encoder or an ldpc decoder based on the parity check matrix.
公开号:BR112019023198A2
申请号:R112019023198
申请日:2018-05-04
公开日:2020-05-19
发明作者:Hsu Cheng-Yi；Lee Chong-You；Chen Ju-Ya；Chiu Mao-Ching；Perrin Fisher-Jeffes Timothy；Chen Wei-Jen；Chang Yen-Shuo
申请人:Mediatek Inc；
IPC主号:

专利说明:

ENHANCED QC — LDPC CODES CROSS REFERENCE FOR RELATED ORDERS
[001] This order claims the benefit of US Provisional Orders Serial Numbers 62 / 501,953, 62 / 517,219, 62 / 525,243 and 62 / 525,797 entitled KB RULE PROJECT FOR NR LDPC CODE and filed on May 5, 2017, 9 June 2017, June 27, 2017 and June 8, 2017, respectively, which are expressly incorporated by reference in this document in their entirety.
TECHNICAL FIELD
[002] The present disclosure generally refers to mobile communication systems and, more particularly, to low density, almost cyclic, parity verification (QC-LDPC) methods and apparatus.
BACKGROUND
[003] The statements in this section merely provide basic information related to this disclosure and may not be state of the art.
[004] Wireless communication systems are widely implemented to provide various telecommunications services such as telephony, video, data, messages, and broadcasts. Typical wireless communication systems can employ multiple access technologies capable of supporting communication with multiple users by sharing available system resources. Examples of such multiple access technologies include Code Division Multiple Access (CDMA) systems, Time Division Multiple Access (TDMA) systems, Frequency Division Multiple Access (FDMA) systems, Division access multiple access systems. orthogonal frequency (OFDMA),
Petition 870190112922, of 11/05/2019, p. 40/110
2/54 multiple access by single carrier frequency division (SC-FDMA), and multiple access systems by time division synchronous code division (TD-SCDMA).
[005] These multiple access technologies have been adopted in various telecommunications standards to provide a common protocol that allows different wireless devices to communicate at the municipal, national, regional, and even global levels. An example of a telecommunications standard is the 5G Novo Rádio (NR). The 5G NR is part of a continuous evolution of mobile broadband promulgated by the Third Generation Partnership Project (3GPP) to meet the new requirements associated with latency, reliability, security, scalability (for example, with Internet of Things (loT)) and other requirements. Some aspects of the 5G NR may be based on the 4G Long Term Evolution (LTE) standard. 3GPP also agreed that QC-LDPC will be used on the 5G NR data channel. There is a need for further improvements in the QC-LDPC encoding.
SUMMARY
[006] The following is a simplified summary of one or more aspects in order to provide a basic understanding of such aspects. This summary is not a comprehensive overview of all aspects covered, and aims not to identify key or critical elements of all aspects or to outline the scope of one or all aspects. Its sole purpose is to present some concepts of one or more aspects in a simplified way as a prelude to the more detailed description that will be presented later.
[007] In one aspect of the disclosure, a method, a computer-readable medium, and an apparatus are provided. THE
Petition 870190112922, of 11/05/2019, p. 41/110
3/54 device can be a UE or a base station. The apparatus determines a code block size (CBS) of information bits contained in a low density parity check (LDPC) coding code word. The apparatus also compares the CBS with at least one limit and determines, based on the result of the comparison, a Kb number. In addition, the device determines a Kp number based on the code rate and the Kb number. The apparatus also generates an LDPC encoding parity check matrix. A piece of information from the parity check matrix is a first matrix formed by the number M of second square matrices. M is equal to Kp multiplied by Kb. A total number of columns in the Kb number of second square arrays is equal to a total number of CBS bits. One or more matrices of the number M of second square matrices are circular permutation matrices. The apparatus operates an LDPC encoder or an LDPC decoder based on the parity check matrix.
[008] In another aspect, a device for wireless communication includes a processor and a memory device coupled to the processor. The memory device contains a set of instructions that, when executed by the processor, cause the processor to determine a code block size (CBS) of information bits contained in a low density parity check codeword (LDPC). The instruction set causes the processor to compare the CBS with at least one limit and determine, based on the result of the comparison, a Kb number. In addition, the instruction set causes the processor to determine a Kp number based on the code rate
Petition 870190112922, of 11/05/2019, p. 42/110
4/54 and in the Kb number. The instruction set also causes the processor to generate an LDPC encoding parity check matrix. A piece of information from the parity check matrix is a first matrix formed by the number M of second square matrices. M is equal to Kp multiplied by Kb. A total number of columns in the Kb number of second square arrays is equal to a total number of CBS bits. One or more matrices of the number M of second square matrices are circular permutation matrices. Finally, the instruction set causes the processor to operate an LDPC encoder or LDPC decoder based on the parity check matrix.
[009] To achieve the foregoing and related purposes, the one or more aspects comprise the resources described below completely and particularly pointed out in the claims. The following description and the accompanying drawings set out in detail certain illustrative characteristics of one or more aspects. These characteristics are indicative, however, of just some of the many ways in which the principles of various aspects can be employed, and this description is intended to include all of these aspects and their equivalents.
BRIEF DESCRIPTION OF THE DRAWINGS
[0010] Figure 1 is a diagram that illustrates an example of a wireless communications system and an access network.
[0011] Figures 2A, 2B, 2C and 2D are diagrams that illustrate examples of a DL frame structure, DL channels within the DL frame structure, a UL frame structure and UL channels within the UL frame structure, respectively.
Petition 870190112922, of 11/05/2019, p. 43/110
5/54
[0012] Figure 3 is a diagram illustrating a base station communicating with a UE on an access network.
[0013] Figure 4 illustrates an example of the logical architecture of a distributed access network.
[0014] Figure 5 illustrates an example of physical architecture of a distributed access network.
[0015] Figure 6 is a diagram showing an example of a subframe centralized in DL.
[0016] Figure 7 is a diagram showing an example of a UL centralized subframe.
[0017] Figure 8 is a diagram of an example of a multi-embedded LDPC code project.
[0018] Figure 9 is a 900 flow chart of a method (process) for using enhanced QC-LDPC codes.
[0019] Figure 10 is a block diagram of an example of a communications system.
[0020] Figure 11 is a block diagram of another example of a communication system.
DETAILED DESCRIPTION
[0021] The detailed description below in connection with the accompanying drawings is intended to be a description of various configurations and does not represent the only configurations in which the concepts described here can be practiced. The detailed description includes specific details in order to provide a complete understanding of various concepts. However, it will be apparent to those skilled in the art that these concepts can be practiced without these specific details. In some cases, known structures and components are shown in the form of a block diagram to avoid obscuring such concepts.
Petition 870190112922, of 11/05/2019, p. 44/110
6/54
[0022] Various aspects of telecommunications systems will now be presented with reference to various devices and methods. These devices and methods will be described in the detailed description below and illustrated in the accompanying drawings by various blocks, components, circuits, processes, algorithms, etc. (collectively referred to as elements). These elements can be implemented in electronic hardware, computer software, or any combination thereof. The implementation of such elements as hardware or software depends on the specific order and project restrictions imposed on the general system.
[0023] As an example, an element, or any part of an element, or any combination of elements can be implemented as a processing system that includes one or more processors. Examples of processors include microprocessors, microcontrollers, graphics processing units (GPUs), central processing units (CPUs), application processors, digital signal processors (DSPs), reduced instruction set computing (RISC) processors, systems in a chip (SoC), baseband processors, field programmable port arrays (FPGAs), programmable logic devices (PLDs), state machines, port logic, discrete hardware circuits, and other suitable hardware configured to run the various features described throughout this release. One or more processors in the processing system can run the software. The software should be interpreted broadly as instructions, instruction sets, code, code segments, program code, programs,
Petition 870190112922, of 11/05/2019, p. 45/110
7/54 subprograms, software components, applications, software applications, software packages, routines, subroutines, objects, executables, threads of execution, procedures, functions, etc., referred to as software, firmware, middleware, microcode, language hardware description, or others.
[0024] Therefore, in one or more exemplary modalities, the functions described can be implemented in hardware, software, or any combination thereof. If implemented in software, functions can be stored or encoded as one or more instructions or code in a computer-readable medium. Computer-readable media includes computer storage media. Storage media can be any available media that can be accessed by a computer. As an example, and not as a limitation, computer-readable media may comprise random access memory (RAM), read-only memory (ROM), an electrically erasable programmable ROM (EEPROM), optical disk storage, disk storage magnetic, other magnetic storage devices, combinations of the aforementioned types of computer-readable media, or any other medium that can be used to store computer-executable code in the form of instructions or data structures that can be accessed by a computer.
[0025] Figure 1 is a diagram illustrating an example of a wireless communications system and an access network 100. The wireless communications system (also known as wireless wide area network (WWAN)) includes base stations
Petition 870190112922, of 11/05/2019, p. 46/110
8/54
102, UEs 104, and an Evolved Packet Core (EPC) 160. Base stations 102 may include macro cells (high power cell base station) and / or small cells (low power cell base station). Macro cells include base stations. Small cells include femtocells, picocells and microcells.
[0026] Base stations 102 (collectively referred to as the Terrestrial Radio Access Network (E-UTRAN) of the Universal Mobile Telecommunications System (UMTS)) interface with EPC 160 through backhaul links 132 (for example, interface Sl ). In addition to other functions, base stations 102 can perform one or more of the following functions: user data transfer, radio channel encryption and decryption, integrity protection, header compression, mobility control functions (for example, transfer , dual connectivity), interference coordination between cells, connection setup and release, load balancing, distribution to non-access layer (NAS) messages, NAS node selection, synchronization, radio access network (RAN) sharing , multimedia transmission multicast service (MBMS), equipment subscriber and tracking, RAN information management (RIM), paging, positioning, and delivery of warning messages. Base stations 102 can communicate directly or indirectly (for example, via EPC 160) with each other via backhaul links 134 (for example, interface X2). The backhaul links 134 can be wired or wireless.
[0027] Base stations 102 can communicate wirelessly with UEs 104. Each of base stations 102 can
Petition 870190112922, of 11/05/2019, p. 47/110
9/54 provide communication coverage for a relevant geographic coverage area 110. There may be overlapping geographic coverage areas 110. For example, small cell 102 'may have coverage area 110' that overlaps coverage area 110 of one or more macro base stations 102. A network that includes small cells and macro cells can be known as a heterogeneous network. A heterogeneous network can also include Domestic Evolved NodeBs (eNBs) (HeNBs), which can provide services to a restricted group known as a closed subscriber group (CSG). Communication links 120 between base stations 102 and UEs 104 may include uplink (UL) transmissions (also called reverse link) from a UE 104 to a base station 102 and / or downlink (DL) transmissions (also called a direct link) from a base station 102 to a UE 104. Communication links 120 may use multiple input and multiple output antenna (MIMO) technology, including spatial multiplexing, beam formation, and / or transmission diversity. The communication links can be through one or more carriers. Base stations 102 / UEs 104 can use a bandwidth spectrum of up to Y MHz (for example, 5, 10, 15, 20, 100 MHz) per carrier allocated in a carrier aggregation of up to a total of Yx MHz (x component carriers) used for transmission in each direction. The carriers may or may not be adjacent to each other. The allocation of carriers can be asymmetric in relation to DL and UL (for example, more or less carriers can be allocated to DL than to UL). Component carriers can include a primary component carrier and one or more secondary component carriers. A carrier
Petition 870190112922, of 11/05/2019, p. 48/110
10/54 primary component can be referred to as a primary cell (PCell) and a secondary component carrier can be referred to as a secondary cell (SCell).
[0028] The wireless communications system may also include a Wi-Fi access point (AP) 150 in communication with Wi-Fi stations (STAs) 152 through communication links 154 in an unlicensed frequency spectrum of 5 GHz When communicating on an unlicensed frequency spectrum, STAs 152 / AP 150 can perform a clean channel assessment (CCA) prior to communication, in order to determine if the channel is available.
[0029] Small cell 102 'can operate on a licensed and / or unlicensed frequency spectrum. When operating on an unlicensed frequency spectrum, the small cell 102 'can employ NR and use the same unlicensed frequency spectrum of 5 GHz as used by Wi-Fi AP 150. The small cell 102', employing NR on a spectrum frequency frequency, can increase coverage and / or increase the capacity of the access network.
[0030] gNodeB (gNB) 180 can operate at millimeter wave frequencies (mmW) and / or near mmW in communication with UE 104. When gNB 180 operates at mmW or near mmW frequencies, gNB 180 can be called mmW base station. The extremely high frequency (EHF) is part of the RF in the electromagnetic spectrum. The EHF has a range of 30 GHz to 300 GHz and a wavelength between 1 mm and 10 mm. Radio waves in the band can be called millimeter waves. Almost mmW can extend up to a frequency of 3 GHz with a wavelength of 100 mm. The super high frequency band (SHF) extends
Petition 870190112922, of 11/05/2019, p. 49/110
11/54 between 3 GHz and 30 GHz, also known as centimeter wave. Communications using the mmW / almost mmW radio frequency band present extremely high loss of path and a short range. The mmW 180 base station can use beamform 184 with UE 104 to compensate for extremely high path loss and short range.
[0031] EPC 160 may include a Mobility Management Entity (MME) 162, other MMEs 164, a Service Gateway 166, a Multimedia Multicast Service Gateway (MBMS) 168, a Multicast Service Center ( BM-SC) 170, and a Packet Data Network Gateway (PDN) 172. MME 162 may be in communication with a Domestic Subscriber Server (HSS) 174. MME 162 is the control node that processes signaling between UEs 104 and EPC 160. Generally, MME 162 provides carrier and connection management. All user Internet Protocol (IP) packets are transferred via Service Gateway 166, which is connected to Gateway PDN 172. Gateway PDN 172 provides UE IP address allocation as well as other functions. Gateway PDN 172 and BM-SC 170 are connected to IP 17 6 services. IP 17 6 services can include the Internet, an intranet, an IP Multimedia Subsystem (IMS), a PS Streaming Service (PSS), and / or other IP services. The BM-SC 170 can provide functions for provisioning and delivering MBMS user service. The BMSC 170 can serve as an entry point for transmitting MBMS from a content provider, can be used to authorize and start MBMS Bearer Services on a public land mobile network (PLMN) and can be used
Petition 870190112922, of 11/05/2019, p. 50/110
12/54 to schedule MBMS transmissions. The MBMS 168 Gateway can be used to distribute MBMS traffic to base stations 102 belonging to a Multiple Frequency Broadcast Network (MBSFN) area that broadcasts a specific service, and can be responsible for session management (start / stop) and by collecting billing information related to eMBMS.
[0032] The base station can also be referred to as gNB, NodeB, evolved NodeB (eNB), an access point, a base transceiver station, a radio base station, a radio transceiver, a transceiver function, a basic set services (BSS), a set of extended services (ESS), or some other appropriate terminology. Base station 102 provides an access point to EPC 160 for an UE 104. Examples of UEs 104 include a cell phone, a smart phone, a login protocol (SIP) phone, a laptop, a personal digital assistant ( PDA), a satellite radio, a global positioning system, a multimedia device, a video device, a digital audio player (for example, MP3 player), a camera, a game console, a tablet, a smart device , a wearable device, a vehicle, an electric meter, a gas pump, a toaster, or any other similar device. Some of the UEs 104 can be called loT devices (for example, parking meter, gas pump, toaster, vehicles, etc.). UE 104 can also be referred to as a station, a mobile station, a subscriber station, a mobile unit, a subscriber unit, a wireless unit, a remote unit, a mobile device, a wireless device
Petition 870190112922, of 11/05/2019, p. 51/110
13/54 wire, a wireless communication device, a remote device, a mobile subscriber station, an access terminal, a mobile terminal, a wireless terminal, a remote terminal, an appliance, a user agent, a customer mobile, a client, or some other suitable terminology.
[0033] Figure 2A is a diagram 200 that illustrates an example of a DL frame structure. Figure 2B is a diagram 230 that illustrates an example of channels within the DL frame structure. Figure 2C is a diagram 250 that illustrates an example of a UL frame structure. Figure 2D is a diagram 280 that illustrates an example of channels within the UL frame structure. Other wireless communication technologies may have a different frame structure and / or different channels. A frame (10 ms) can be divided into 10 subframes of equal size. Each subframe can include two consecutive time slots. A resource grid can be used to represent the two time slots, each time slot including one or more simultaneous resource blocks (RBs) (also known as physical RBs (PRBs)). The resource grid is divided into several resource elements (REs). For a normal cyclic prefix, an RB contains 12 consecutive subcarriers in the frequency domain and 7 consecutive symbols (for DL, OFDM symbols; for UL, SC-FDMA symbols) in the time domain, for a total of 84 REs. For an extended cyclic prefix, an RB contains 12 consecutive subcarriers in the frequency domain and 6 consecutive symbols in the time domain, for a total of 72 ERs. The number of bits carried by each RE depends on the modulation scheme.
[0034] As illustrated in Figure 2A, some of the REs
Petition 870190112922, of 11/05/2019, p. 52/110
14/54 carry DL (pilot) reference signals (DL-RS) for channel estimation in the UE. The DL-RS may include cell-specific reference signals (CRS) (also possibly called common RS), UE-specific reference signals (UE-RS), channel status information reference signals (CSI-RS) . Figure 2A illustrates CRS for antenna ports 0, 1, 2, and 3 (indicated as RO, Rl, R2 and R3, respectively), UE-RS for antenna port 5 (indicated as R5) and CSI-RS to the antenna port 15 (indicated as R). Figure 2B illustrates an example of several channels within a DL subframe of a frame. The physical control format indicator channel (PCFICH) is within the 0 symbol of interval 0 and carries a control format indicator (CFI) that indicates whether the downlink physical control channel (PDCCH) occupies 1, 2, or 3 symbols (Figure 2B illustrates a PDCCH that occupies 3 symbols). The PDCCH carries downlink control (DCI) information within one or more elements of the control channel (CCEs), each CCE including nine RE groups (REGs), each REG including four consecutive REs in an OFDM symbol. A UE can be configured with an enhanced UE-specific PDCCH (ePDCCH) that also carries DCI. The ePDCCH can have 2, 4 or 8 RB pairs (Figure 2B shows two RB pairs, each subset including an RB pair). The physical hybrid auto-repeat request (ARQ) indicator (HARQ) (PHICH) indicator channel is also at the 0 symbol in the 0 range and carries the HARQ (HI) indicator that indicates negative HARQ (ACK) / ACK confirmation feedback (NACK ) based on the physical uplink shared channel (PUSCH). The primary synchronization channel (PSCH) can be within the
Petition 870190112922, of 11/05/2019, p. 53/110
15/54 symbol 6 of interval 0 within subframes 0 and 5 of a frame. The PSCH carries a primary synchronization signal (PSS) which is used by a UE to determine the subframe / symbol time and an identity of the physical layer. The secondary synchronization channel (SSCH) can be within symbol 5 of interval 0 within subframes 0 and 5 of a frame. The SSCH carries a secondary synchronization signal (SSS) which is used by a UE to determine a physical layer cell identity group number and the time of the radio frame. Based on the physical layer identity and the physical layer cell identity group number, the UE can determine a physical cell identifier (PCI). Based on the PCI, the UE can determine the DL-RS locations mentioned above. The physical broadcast channel (PBCH), which carries a master information block (MIB), can be logically grouped with the PSCH and SSCH to form a synchronization signal block (SS). The MIB provides several RBs in the DL system bandwidth, a PHICH configuration and a system frame number (SFN). The physical downlink shared channel (PDSCH) carries user data, broadcast system information not transmitted through the PBCH as system information blocks (STBs), and paging messages.
[0035] As illustrated in Figure 2C, some of the REs transmit demodulation reference signals (DM-RS) for channel estimation at the base station. The UE can additionally transmit audible reference signals (SRS) on the last symbol of a subframe. The SRS can have a comb structure, and a UE can transmit SRS in one of the combs. The SRS can be used by a base station to estimate the
Petition 870190112922, of 11/05/2019, p. 54/110
16/54 channel quality to allow frequency-dependent scheduling at UL. Figure 2D illustrates an example of several channels within a UL subframe of a frame. A physical random access channel (PRACH) can be within one or more subframes within a frame based on the PRACH configuration. The PRACH can include six consecutive RB pairs within a subframe. The PRACH allows the UE to perform initial system access and achieve UL synchronization. A physical uplink control channel (PUCCH) can be located at the edges of the UL system bandwidth. 0 PUCCH carries uplink control (UCI) information, such as scheduling requests, a channel quality indicator (CQI), a pre-coding matrix indicator (PMI), a rating indicator (RI), and feedback HARQ ACK / NACK. The PUSCH carries data and can be used in addition to carry a buffer status report (BSR), a power headroom report (PHR) and / or UCI.
[0036] Figure 3 is a block diagram of a base station 310 in communication with a UE 350 in an access network. In the DL, EPC 160 IP packets can be delivered to a 375 controller / processor. The 375 controller / processor implements layer 3 and layer 2 functionality. Layer 3 includes a radio resource control (RRC) layer , and layer 2 includes a packet data convergence protocol layer (PDCP), a radio link control layer (RLC), and a media access control layer (MAC). The 375 controller / processor provides RRC layer functionality associated with the diffusion of system information (for example, MIB, STBs),
Petition 870190112922, of 11/05/2019, p. 55/110
17/54 RRC connection (for example, RRC connection paging, RRC connection establishment, RRC connection modification, and RRC connection release), mobility of inter-radio access technology (RAT), and measurement configuration for reporting of EU measurement; PDCP layer functionality associated with header compression / decompression, security (encryption, decryption, integrity protection, integrity verification), and delivery support functions; RLC layer functionality associated with the transfer of upper layer packet data units (PDUs), error correction via ARQ, concatenation, segmentation, and reassembly of RLC service data units (SDUs), re-segmentation of data PDUs from RLC, and reordering of data RLC PDUs; and MAC layer functionality associated with mapping between logical channels and transport channels, multiplexing from MAC SDUs to transport blocks (TBs), demultiplexing MAC MACs from TBs, scheduling information reporting, error correction through HARQ, treatment of priorities and prioritization of logical channels.
[0037] The transmit processor (TX) 316 and the receive processor (RX) 370 implement layer 1 functionality associated with various signal processing functions. Layer 1, which includes a physical layer (PHY), can include error detection on transport channels, direct error correction (FEC) encoding / decoding of transport channels, interleaving, rate matching, mapping on physical channels, channel modulation / demodulation and MIMO antenna processing. The TX 316 processor handles the mapping to
Petition 870190112922, of 11/05/2019, p. 56/110
18/54 signal constellations based on various modulation schemes (for example, phase shift binary switching (BPSK), quadrature phase shift switching (QPSK), M phase shift switching (PSPS), phase modulation amplitude of M-quadrature (M-QAM)). The coded and modulated symbols can then be divided into parallel streams. Each stream can then be mapped to an OFDM subcarrier, multiplexed with a reference signal (for example, pilot) in the time and / or frequency domain, and then combined using a Fast Inverse Fourier Transformation (IFFT) to produce a channel physicist carrying an OFDM symbol stream in the time domain. The OFDM stream is spatially precoded to produce multiple spatial streams. Channel estimates from a channel estimator 374 can be used to determine the coding and modulation scheme, as well as for spatial processing. The channel estimate can be derived from a reference signal and / or channel condition feedback transmitted by the UE 350. Each spatial flow can then be supplied to a different antenna 320 via a separate 318TX transmitter. Each 318TX transmitter can modulate an RF carrier with a corresponding spatial flow for transmission.
[0038] In the UE 350, each 354RX receiver receives a signal through its respective 352 antenna. Each 354RX receiver retrieves modulated information on an RF carrier and supplies the information to the receiving (RX) 356 processor. The TX 368 processor and the RX 356 processor implements layer 1 functionality associated with various signal processing functions. The RX 356 processor can run
Petition 870190112922, of 11/05/2019, p. 57/110
19/54 spatial processing in the information to retrieve any spatial streams destined for the UE 350. If multiple spatial streams are destined for the UE 350, they can be combined by the RX 356 processor into a single OFDM symbol stream. The RX 356 processor then converts the OFDM symbol stream from the time domain to the frequency domain using a Fast Fourier Transformation (FFT). The signal in the frequency domain comprises a separate OFDM symbol stream for each OFDM signal subcarrier. The symbols on each subcarrier and the reference signal are retrieved and demodulated by determining the most likely signal constellation points transmitted by base station 310. These flexible decisions can be based on channel estimates computed by channel estimator 358. Decisions smooth signals are then decoded and deinterleaved to retrieve the data and control signals that were originally transmitted by base station 310 on the physical channel. The data and control signals are then supplied to the 359 controller / processor, which implements the layers 3 and 2 functionality.
[0039] The 359 controller / processor can be associated with a 360 memory that stores program codes and data. Memory 360 can be referred to as a computer-readable medium. At UL, the 359 controller / processor provides demultiplexing between transport and logical channels, packet reassembly, decryption, header decompression, and control signal processing to retrieve IP packets from EPC 160. The 359 controller / processor is also responsible for detection errors using an ACK and / or NACK protocol to support HARQ operations.
Petition 870190112922, of 11/05/2019, p. 58/110
20/54
[0040] Similar to the functionality described in connection with DL transmission by base station 310, the 359 controller / processor provides RRC layer functionality associated with the acquisition of system information (for example, MIB, SIBs), RRC connections, and reporting of measurement; PDCP layer functionality associated with header compression / decompression, and security (encryption, decryption, integrity protection, integrity verification); RLC layer functionality associated with the transfer of top layer PDUs, error correction through ARQ, concatenation, segmentation, and reassembly of RLC SDLCs, re-segmentation of RLC data PDUs, and reordering of RLC data PDUs; and MAC layer functionality associated with mapping between logical channels and transport channels, multiplexing from MAC SDUs to TBs, demultiplexing from MAC SDUs to TBs, reporting scheduling information, correcting errors through HARQ, handling priorities, and prioritizing logical channels.
[0041] Channel estimates derived by a channel estimator 358 from a reference signal or feedback transmitted by base station 310 can be used by the TX 368 processor to select the appropriate coding and modulation schemes, and to facilitate processing space. The spatial streams generated by the TX 368 processor can be supplied to different antennas 352 through separate transmitters 354TX. Each 354TX transmitter can modulate an RF carrier with a corresponding spatial flow for transmission. The UL transmission is processed at the base station 310 in a manner similar to that described in connection with the receiver function in the UE 350.
Petition 870190112922, of 11/05/2019, p. 59/110
21/54
Each 318RX receiver receives a signal through its respective antenna 320. Each 318RX receiver retrieves modulated information on an RF carrier and provides the information to an RX 370 processor.
[0042] The 375 controller / processor can be associated with a 376 memory that stores program codes and data. Memory 376 can be referred to as a computer-readable medium. At UL, the 375 controller / processor provides demultiplexing between transport and logical channels, packet reassembly, decryption, header decompression, control signal processing to retrieve IP packets from the UE 350. IP packets from the 375 controller / processor can be provided to the EPC 160. The 375 controller / processor is also responsible for error detection using an ACK and / or NACK protocol to support HARQ operations.
[0043] New radio (NR) can refer to radios configured to operate according to a new air interface (for example, other than air based interfaces (OFDMA) or fixed transport layer (for example, other than the Internet Protocol (IP))). NR can use OFDM with a cyclic prefix (CP) on the uplink and downlink and can include support for half duplex operation using time division duplexing (TDD). NR can include enhanced mobile broadband service (eMBB) targeting a wide bandwidth (for example, in addition to 80 MHz), millimeter wave (mmW) targeting high carrier frequency (for example, 60 GHz), massive MTC (mMTC) targeting MTC techniques not compatible with previous versions, and / or mission critical targeting low-level communications service
Petition 870190112922, of 11/05/2019, p. 60/110
22/54 ultra-reliable latency (URLLC).
[0044] A single component carrier bandwidth of 100 MHZ can be supported. In one example, NR resource blocks (RBs) can span 12 subcarriers with a 75 kHz subcarrier bandwidth for a duration of 0.1 ms or a bandwidth of 15 kHz for a duration of 1 ms. Each radio frame can consist of 10 or 50 subframes with a length of 10 ms. Each subframe can be 0.2 ms long. Each subframe can indicate a link direction (ie, DL or UL) for data transmission and the link direction for each subframe can be switched dynamically. Each subframe can include DL / UL data as well as DL / UL control data. The subframes UL and DL for NR can be as described in more detail below in relation to FIGs. 6 and 7.
[0045] The beam formation can be supported and the beam direction can be dynamically configured. MIMO transmissions with pre-coding can also be supported. The MIMO configurations on the DL can support up to 8 transmission antennas with multi-layered DL transmissions up to 8 streams and up to 2 streams per UE. Multilayered transmissions with up to 2 streams per EU can be supported. Multiple cell aggregation can be supported with up to 8 service cells. Alternatively, NR can support a different overhead interface, other than an OFDM based interface.
[0046] The NR RAN can include a central unit (CU) and distributed units (DUs). An NR BS (for example, gNB, 5G NodeB, NodeB, transmit receive point (TRP), access point (AP)) can correspond to one or more BSs.
Petition 870190112922, of 11/05/2019, p. 61/110
23/54
NR cells can be configured as access cells (ACells) or data-only cells (DCells). For example, the RAN (for example, a central unit or distributed unit) can configure the cells. DCells can be used for carrier aggregation or dual connectivity and cannot be used for initial access, cell selection / reselection, or transfer. In some cases DCells may not transmit synchronization (SS) signals, in some cases DCells may transmit SS. NR BS can transmit downlink signals to UEs indicating the cell type. Based on the indication of the cell type, the UE can communicate with the NR BS. For example, the UE can determine NR BSs to be considered for selection, access, transfer, and / or measurement of cells based on the indicated cell type.
[0047] Figure 4 illustrates an example of logical architecture 400 of a distributed RAN, according to aspects of the present disclosure. An access node 5G 406 can include an access node controller (ANC) 402. The ANC can be a central unit (CU) of the distributed RAN 400. The backhaul interface for the next generation main network (NG-CN) 404 may end at ANC. The backhaul interface for neighboring next generation access nodes (NG-ANs) can end at ANC. The ANC may include one or more 408 TRPs (which may also be referred to as BSs, NR BSs, NodeBs, 5G NBs, APs, or some other term). As described above, a TRP can be used interchangeably with a cell.
[0048] TRPs 408 can be a distributed unit (DU). TRPs can be connected to an ANC (ANC 402) or more than one ANC (not shown). For example, for
Petition 870190112922, of 11/05/2019, p. 62/110
24/54 RAN sharing, radio as a service (RaaS) and service-specific AND deployments, the TRP can be connected to more than one ANC. A TRP can include one or more antenna ports. TRPs can be configured to serve individually (for example, dynamic selection) or together (for example, joint transmission) for traffic to a UE.
[0049] The local architecture of the distributed RAN 400 can be used to illustrate the definition of fronthaul. The architecture can be defined to support fronthauling solutions in different types of deployment. For example, the architecture can be based on the transmission network resources (for example, bandwidth, latency, and / or jitter). The architecture can share resources and / or components with LTE. According to the aspects, the next generation AN (NG-AN) 410 can support dual connectivity with NR. NG-AN can share a common fronthaul for LTE and NR.
[0050] The architecture can allow cooperation between TRPs 408. For example, cooperation can be predefined within a TRP and / or between TRPs via ANC 402. According to aspects, no inter-TRP interface may be required / gift.
[0051] According to aspects, a dynamic configuration of divided logic functions can be present in the distributed RAN 400 architecture. The PDCP, RLC, MAC protocol can be placed adaptably in the ANC or TRP.
[0052] Figure 5 illustrates an example of physical architecture of a distributed RAN 500, according to aspects of the present disclosure. A primary network drive
Petition 870190112922, of 11/05/2019, p. 63/110
Centralized 25/54 (C-CU) 502 can host core network functions. C-CU can be deployed centrally. The C-CU functionality can be downloaded (for example, for advanced wireless services (AWS)), in an effort to handle peak capacity. A centralized RAN unit (CRU) 504 can host one or more ANC functions. Optionally, the C-RU can host the main network functions locally. C-RU may have a distributed deployment. The C-RU may be closer to the network edge. A distributed unit (DU) 506 can host one or more TRPs. DU can be located at the edges of the network with radio frequency (RF) functionality.
[0053] Figure 6 is a diagram 600 showing an example of a subframe centered in DL. The DL centered subframe may include a control portion 602. The control portion 602 may exist at the beginning or beginning portion of the DL centered subframe. Control portion 602 may include various scheduling information and / or control information corresponding to various portions of the DL centralized subframe. In some configurations, the control portion 602 can be a physical DL control channel (PDCCH), as shown in Figure 6. The DL centered subframe can also include a DL 604 data portion. The DL 604 data portion can sometimes referred to as the payload of the subframe centralized in DL. The DL 604 data portion may include the communication resources used to communicate DL data from the scheduling entity (for example, UE or BS) to the subordinate entity (for example, UE). In some configurations, the DL 604 data portion can be a channel
Petition 870190112922, of 11/05/2019, p. 64/110
26/54 shared physical DL (PDSCH).
[0054] The DL centralized subframe can also include a common UL portion 606. The common UL portion 606 can sometimes be referred to as a UL burst, a common UL burst and / or several other suitable terms. The common UL portion 606 can include feedback information corresponding to several other parts of the DL centralized subframe. For example, common UL portion 606 may include feedback information corresponding to control portion 602. Non-limiting examples of feedback information may include an ACK signal, a NACK signal, an HARQ indicator, and / or several other suitable types of information . The common UL portion 606 may include additional or alternative information, such as information pertaining to random access channel (RACH) procedures, scheduling requests (SRs), and various other suitable types of information.
[0055] As illustrated in Figure 6, the end of the DL 604 data portion can be separated in time from the beginning of the common UL portion 606. Sometimes this time separation can be called a gap, guard period, interval custody, and / or other appropriate terms. This separation provides time for the transition from DL communication (for example, receiving operation by the subordinate entity (for example, UE)) to UL communication (for example, transmission by the subordinate entity (for example, UE)). One skilled in the art will understand that the precedent is just an example of a subframe centralized in DL and alternative structures with similar characteristics can exist without necessarily deviating from the aspects described here.
Petition 870190112922, of 11/05/2019, p. 65/110
27/54
[0056] Figure 7 is a diagram 700 showing an example of a subframe centralized at UL. The UL-centered subframe may include a control portion 702. The control portion 702 may exist in the initial or initial portion of the UL-centered subframe. The control portion 702 in Figure 7 can be similar to the control portion 602 described above with reference to Figure 6. The UL-centered subframe can also include a UL 704 data portion. The UL 704 data portion can sometimes be referred to as the payload of the UL centralized subframe. The UL portion can refer to the communication resources used to communicate UL data from the subordinate entity (for example, UE) to the scheduling entity (for example, UE or BS). In some configurations, control portion 702 may be a physical DL control channel (PDCCH).
[0057] As illustrated in Figure 7, the end of the control portion 702 can be separated in time from the beginning of the UL 704 data portion. Sometimes, this time separation can be called an interval, guard period, interval guardianship, and / or several other suitable terms. This separation provides time for the transition from DL communication (for example, reception operation by the scheduling entity) to UL communication (for example, transmission by the scheduling entity). The UL-centered subframe can also include a common UL portion 706 in Figure 7. The common UL portion 706 in Figure 7 may be similar to the common UL portion 706 described above with reference to Figure 7. The common UL portion 706 may additionally or alternatively include information regarding to the channel quality indicator
Petition 870190112922, of 11/05/2019, p. 66/110
28/54 (CQI), sound reference signals (SRSs), and several other suitable types of information. One skilled in the art will understand that the precedent is just an example of a subframe centralized at UL and alternative structures with similar characteristics can exist without necessarily deviating from the aspects described here.
[0058] In some circumstances, two or more subordinate entities (for example, UEs) can communicate using side link signals. Real-world applications of such side link signal communications may include public safety, proximity services, EU-to-network relay, vehicle-to-vehicle (V2V) communications, Internet of Everything (loE) communications, loT communications, mission loop criticizes, and / or several other suitable applications. Generally, a side link signal can refer to a signal communicated from a subordinate entity (eg UE1) to another subordinate entity (eg UE2) without relaying that communication via the scheduling entity (eg UE or BS), even though the scheduling entity can be used for scheduling and / or control purposes. In some examples, side link signals can be communicated using a licensed spectrum (unlike wireless local area networks, which normally use an unlicensed spectrum).
[0059] Modalities are disclosed below for the use of LDPC codes in cell phones and other communication systems. LDPC codes are linear block codes, which can be constructed using a sparse split graph.
Petition 870190112922, of 11/05/2019, p. 67/110
29/54
[0060] LDPC codes are defined by a sparse parity check matrix. Consider an LDPC code (N, K), where K is the length of the information block and N is the length of the encoded block. Its parity check matrix is of size (N-K) * N, whose major elements are 0. As a linear block code, the encoding of an LDPC code is based on its generating matrix. Decoding LDPC codes is based on a belief propagation algorithm or sum-product decoding.
[00 61] The design of a good LDPC code depends on the design of your parity check matrix. A type of LDPC code constructed in a deterministic and systematic way is called quasi-cyclic LDPC code (QCLDPC). See IEEE Std 802.1 1-2012, Wireless LAN and Physical Layer (PHY) Media Access Control (MAC) Specifications for a standardized implementation of QC-LDPC codes. A QC-LDPC code can be defined exclusively by its base chart B.
[0062] LDPC codes are adopted in various standards and used in many communication systems, for example, the DVB-S2 standard for digital television satellite transmission, ITU-T G. Hn standard, 10GBase-T Ethernet system, and the 802.11 Wi-Fi standard. In 5G, there are some use cases that make LDPC codes specific to use. For example, there is a use case for enhanced mass mobile broadband (eMBB) communications.
[0063] Generally, a QC-LDPC matrix can be described by its equivalent split graph (Tanner graph), where each end of the Tanner graph connects a variable node
Petition 870190112922, of 11/05/2019, p. 68/110
30/54 from a plurality of variable nodes (which form the first set of the bipartite graph) to a check node of a plurality of check nodes (which form the second set of the bipartite graph). A well-known construction of LDPC codes is based on protographs, also called base graphics or projected graphics. In these constructions, a bipartite base graph G is copied N times and for each edge and G, a permutation is applied to the N copies of and to interconnect the N copies of G, the resulting graph, called N-cover or the N-elevation of G, is then used as the Tanner plot of the LDPC code. If the permutations are cyclic, the resulting LDPC code is called a quasi-cyclic (QC).
[00 64] LDPC QC codes are attractive due to their relatively simple implementation and analysis. For example, a QC-LDPC matrix of r rows and columns can be represented by its equivalent split graph with check nodes and variable nodes with borders between check nodes and variable nodes if there are 1 corresponding s in the QC-LDPC matrix ( cf. R. Tanner, A Recursive Approach to Low Complexity Codes, IEEE TRANSACTIONS IN Information THEORY, Volume 27, Issue 5, Pages 533-547, September 1981). Thus, the variable nodes represent bits of the code word and the verification nodes represent the parity verification equations.
[0065] In certain configurations, different types of base graphics can be used for LDPC QC codes depending on the size of the selected information blocks and the code rates (CRs), for example. CR is defined as the number of bits of information divided by the number of
Petition 870190112922, of 11/05/2019, p. 69/110
31/54 encoded bits.
[00 66] Figure 8 is a diagram illustrating a technique used by a base station (for example, base station 102) or a UE (for example, UE 104) to generate a parity check matrix (PCM) . An exemplary base graph 802 defines a basic structure of the parity check matrix to be generated by the base station or the UE. In this example, the base 802 chart has 8 columns. In addition, in the example, the base graph 802 has an information region 803-1 and a parity region 803-2. In this example, information region 803-1 contains the first four columns and parity region 803-2 contains the rest of the columns. In this technique, the base station and / or the UE, when generating the PCM, selects a region from the 802 base graph, and replaces each 1 in the selected region with a circular permutation matrix (CPM) of size Z χ Z (for example , 8x8) and each 0 in the selected region with a Z χ Z matrix of all zeros (for example, 830 elements), with Z being an elevation factor. Each CPM is an identity matrix with lines shifted cyclically by an amount as described below. Figure 8 shows exemplary CPMs 808, 810.
[00 67] The lines of an 812 parity check matrix, generated as described below, are the coefficients of the parity check equations. That is, they show how the linear combinations of certain digits (components) of each code word are equal to zero. For example, the parity check matrix
H = <t gioo ^ compactly represents the parity check equations,
Petition 870190112922, of 11/05/2019, p. 70/110
32/54
C3 + C4 = 0 Cl + C2 = 0 this must be satisfied for ci C2 cs C4 to be a code word.
[0068] More specifically, to generate the PCM, the UE or base station initially replaces 1 s in the 802 base graph with an identification matrix of size Z. In addition, the UE or base station cyclically shifts elements of the identity matrix based on a corresponding displacement coefficient table 806. A specific positive number in the displacement coefficient table 806 indicates that the corresponding identity matrix in the base graph 802 must be shifted to the right a specific number of times. A specific negative number in the displacement coefficient table 806 indicates that the corresponding identity matrix in the base graph 802 must be shifted to the left a specific number of times. For example, a displacement coefficient 807-1 in the displacement coefficient table 806 corresponds to an element 804-1 in the base graph 802. The number 0 of displacement coefficient 807-1 indicates that the identity matrix is not displaced. Therefore, element 804-1 is replaced by CPM 808 in the generated parity check matrix 812. A displacement coefficient 807-2 in the displacement coefficient table 806 corresponds to an element 804-2 in the base graph 802. The number 2 of displacement coefficient 807-2 indicates that the identity matrix is shifted to the right twice. Therefore, element 8041 is replaced by CPM 810 in the generated parity check matrix 812.
Petition 870190112922, of 11/05/2019, p. 71/110
33/54
[0069] The 812 parity check matrix has two parts. A first portion 816 (corresponding to the information region 803-1 of the base graphic 802) represents the portion of information columns and a second portion 818 (corresponding to parity region 803-2 of the base graphic 802) represents a portion of columns of parity. Using a technique described below, the UE or base station can determine a Kb number. Based on the Kb number, the UE or base station uses all or only a selected portion 814 of the base graph 802 to generate the parity check matrix 812. The selected portion 814 consists of two parts with one part including a subset of the columns information from the parity check matrix 812 and a second part including a subset of parity columns from the parity check matrix 812. In the example shown, the first portion 816 of the parity check matrix 812 has a 4x4 size of the columns of information and the second portion 818 has the same 4x4 size as the parity columns. However, sub-matrix 814 uses only columns of information bits 820 of Kb number (for example, 3) and columns of parity bits 821 of number Kp (for example, 2). The Kp number is determined based on the Kb number and the code rate. For example, if the Kb number is 3 and the code rate is 2/3, the Kp number is 3 * 2/3 (that is, 2). The parity part is a square matrix with a size of Kp per Kp. In this example, two parts of sub-matrix 814 have sizes 2x3 and 2x2 corresponding to the information part and parity part, respectively. In particular, the UE or base station selects a sub-matrix that has a size of Kp per Kb and that includes the last information element 804
Petition 870190112922, of 11/05/2019, p. 72/110
34/54 on the first line from the information region 803-1 of the base graph 802 to form the first portion 816 of the parity check matrix 812. The UE or base station selects a square sub-matrix that has a size of Kp per Kp and that includes the first parity element 804-4 in the first line of the region from parity 803-2 of the base graph 802 to form the second portion 818 of the parity check matrix 812. Kp is a number that can be determined based on the Kb number and the adopted code rate.
[0070] A code block size (CBS) of an LDPC code indicates the number of bits of information in the LDPC code. Thus, CBS is equal to the number of columns in the information region of sub-matrix 814. As discussed above, each line in the information region of sub-matrix 814 contains the number of Kb CPMs. Each CPM is a Z by Z matrix. Therefore, CBS can be represented by the following equation (1):
CBS = Kb * Z (1).
[0071] Figure 8 shows that the information region of sub-matrix 814 has columns of information bits 820 of number Kb (for example, 3).
[0072] Z is also called the elevation factor. In general, LDPC code performance is better if Kb or Z is higher. Larger Kb provides greater freedom of information in the column, which can lead to better performance. Larger Z provides greater freedom in the displacement coefficient matrix, which can lead to better performance.
[0073] There is an exchange between the Kb number and the selection of the elevation Z factor. The effect of the increased size of the columns of the information bits (Kb) and / or the elevation factor
Petition 870190112922, of 11/05/2019, p. 73/110
35/54
Upper Z is highly non-linear. The benefits of the size of Kb and the elevation factor Z saturate differently. Whether Kb or Z determines performance in general depends on CBS. Therefore, the selection of these factors can be rebalanced to improve the performance of the LDPC QC codes. The performance of LDPC QC codes is generally better for larger CBS as it provides greater flexibility for the size of the Kb information columns and the Z elevation factor. Higher CBS provides the benefit of a high degree of randomness in relation to the passage of information between nodes.
[0074] As noted above, for the initial transmission of a transport block with a specific code rate and for the subsequent retransmission of the same transport block, each code block of the transport block is encoded with LDPC with the base graphic 1 or the base chart 2 according to certain rules. Typically, the LDPC 1 base chart covers 8/9 ~ 2/3 CR and small to larger block sizes, while the LDPC 2 base chart covers 2/3 ~ 1/5 CR and very low sizes to medium blocks. The LDPC base chart 1 is a matrix with 46 lines with row indexes i = 0, 1, 2, ..., 45 and 68 columns with column indexes j = 0, 1, 2, ..., 67. O LDPC base chart 2 is a matrix with 42 lines with row indexes i = 0, 1, 2, ..., 41 and 52 columns with column indexes j = 0, 1, 2, ..., 51. The elements with row and column indices provided in Table 1 (for LDPC the base graph 1) and in Table 2 (for LDPC the base graph 2) are of value 1 and all other elements are of value 0.
Petition 870190112922, of 11/05/2019, p. 74/110
36/54
llllllllllllll illlllllllllllllllllllllllllllililillililililillill ///// | iia / (/ (: (/ (/ (| / | / l | / | / ( lliillliiiiiii <777777777777776: 6: 6: 6: 6: 6: 6: S> 6: 6: 6: 6: 6: 6: 6: 6: 6: fi | // // iiiioiêisõB llllllllllll rig /// ii /////////: íí: ///////// + / Ãà ////// iiiii iiiii iiiii iiiii iiiii iiiii iiiii iiiiii iiiiiiiiiiiiiii iiiii iiiiiii (iiiiiii iiiiiii iiiiiii iiiiiii iiiiiii iiiiiii iiiiiii | / |250 307 73 223 211 294 0 135 ///////////// (/ /////////////////: / : ((((:( :( :( :( :(: 96 2 290 120 0 348 6 13869 19 15 16 198 118 0 227 (/ (/ (/ (/ (/ (/ (/ (/ (/ / (/ (/ //////////; ÍO ///// : ((((:( :( :( :( :(: 65 210 60 131 183 15 81 220226 50 103 94 188 167 0 126 /////// | // s //////////; Í3 ///// : ((((:( :( :( :( :(: 63 318 130 209 108 81 182 173159 369 49 91 186 330 0//////////: + 8 ///// 75 55 184 209 68 176 53 142100 181 240 74 219 207 0 84 //////////: 25 ///// 179 269 51 81 64 113 46 49 ísíÍísss 10 216 39 10 4 165 0 83 ////////// Í7 ///// 0 0 0 0 0 0 0 059 317 15 0 29 243 0 53 /////////// | ////// (: (((((((((((((( 64 13 69 154 270 190 88 78 10 229 288 162 205 144 250 0 225 /////////// 3 ////// (: (((((((((((((( 49 338 140 164 13 293 198 152110 109 215 216 116 1 0 205 s //////// | // s //////////: ++ ///// (: (((((((((((((( 49 57 45 43 99 332 160 84191 17 164 21 216 339 0 128 //////; / | Í /// //////////ONLY///// (: (((((((((((((( 51 289 115 189 54 331 122 59 357 133 215 115 201 0 75 /////////: / 22 ///// 154 57 300 101 0 114 182 205 15 195 215 298 14 233 53 0 135 /////////: / 38 ///// 0 0 0 0 0 0 0 0 16 23 106 110 70 144 347 0 217 ///////////: 0 ////// 7 260 257 56 153 110 91 183 18 190 242 113 141 95 304 0 220 ////////// Ííi ////: 164 303 147 110 137 228 184 112 19 35 180 16 198 216 167 0 θα // llill / //////////: + 6 ///// 59 81 128 200 0 247 30 106 sísàssís 239 330 189 104 73 47 0 105 ........................ il ........... /////////: / + (7 ///// 1 358 51 63 0 116 3 21931 346 32 81 261 188 0 137 /: /: /: /: /: /: /: / 21 ///// : ((((:( :( :( :( :(: 144 375 228 4 162 190 155 129 22 1 1 1 1 1 1 0 1 / (/ (/ (/ (/ (/ (/ (/ 39 (: (/ (/ (/ ( : ((((:( :( :( :( :(: 0 0 0 0 0 0 0 0 23 0 0 0 0 0 0 0 0 :(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(1(:(:(:(:(:(:(:( :( :( : ((((:( :( :( :( :(: 42 130 260 199 161 47 1 183 2 76 303 141 179 77 22 96 :( :( :( :( :( :( :( :( :( :( :( :( :( :( :( :( 1 (2 (:( :( :( :( :( :( :( : ((((:( :( :( :( :(: 233 163 294 110 151 286 41 215 Í // Í2555 239 76 294 45 162 225 11 236 /////// | /// i : (: (: (: (: (: (: (: (: (: (: (: (: (: (: (: (+ 3 (:( :( :( :( :( :( :( 8 280 291 200 0 246 167 180117 73 27 151 223 96 124 136 Ϊ /////// 1 ///// : (: (: (: (: (: (: (: (: (: (: (: (: (: (: (: (+ 8 (:( :( :( :( :( :( :( 155 132 141 143 241 181 68 143124 288 261 46 256 338 0 221 : (: (: (: (: (: (: (: (: (: (: (: (: (: (: (: (+ 9 (:( :( :( :( :( :( :( 147 4 295 186 144 73 148 1471 144 161 119 160 268 10 128 :( :( :( :( :( :( :( :( :( :( :( :( :( :( :(: 40 (:( :( :( :( :( :( :( 0 0 0 0 0 0 0 0 sísísisíísí 222 331 133 157 76 112 0 92 /////////// ffi: ///// 60 145 64 8 0 87 12 179 ísíÍísss 104 331 4 133 202 302 0 172 /////////// + ////// 73 213 181 6 0 110 6 108173 178 80 87 117 50 2 56 s ////// s | l /// (:( :( :( :( :( :( :( :( :( :( :( :( :( :( :( :(: 7 :( :( :( :( :( :( :( :( (: (: (((((((((((((( 72 344 101 103 118 147 166 159220 295 129 206 109 167 16 11 (/ (/ (/ (/ (/ (/ 1 (1 / (/ (:( (: (: (: (: (: (: (: (: (: (: (: (: (: (: (: (: (((8 (:( :( :( :( :( :( :( :(: (: (((((((((((((( 127 242 270 198 144 258 184 138102 342 300 93 15 253 60 189 (: (: (: (: (: (: (: (: (: (: (: (: (: (: (: (: + 0 :( :( :( :( :( :( :( :( (: (((((((((((((( 224 197 41 8 0 204 191 196 IIBa + ss 109 217 76 79 72 334 0 95 (:( :( :( :( :( :( :( :( :( :( :( :( :( :( :( 4 (+ :( :( :( :( :( :( :( :( 0 0 0 0 0 0 0 0 15 132 99 266 9 152 242 6 85 (:( :( :( :( :( :( :( :( :( :( :( :( :( :( :( :(: 0 (:( :( :( :( :( :( :( :(: 151 187 301 105 265 89 6 77 16 142 354 72 118 158 257 30 153 (:( :( :( :( :( :( :( :( :( :( :( :( :( :( :( :(: 3 (:( :( :( :( :( :( :( :(: 186 206 162 210 81 65 12 187 I5ii75ss 155 114 83 194 147 133 0(:( :( :( :( :( :( :( :( :( :( :( :( :( :( :( :(: 9 (:( :( :( :( :( :( :( :(: 217 264 40 121 90 155 15 203 19 255 331 260 31 156 9 168 163 ///// iB /// (: (: (: (: (: (: (: (: (: (: (: (: (: (: (: (: + (+ :( :( :( :( :( :( :( :( :( 47 341 130 214 144 244 5 167 seSSÈÍssís 28 112 301 187 119 302 31 216 ////////// 2 (2 ///// 160 59 10 183 228 30 30 130 22 0 0 0 0 0 0 105 0 ////////// 4 (2 ///// 0 0 0 0 0 0 0 0 5 // 23 // 5 0 0 0 0 0 0 0 0 (((((((((((((((((((((((((((((((((((I :::::::::::::::: ::: : ((((:( :( :( :( :(: 249 205 79 192 64 162 6 197 5 /// 24 /// 5 0 0 0 0 0 0 0:( :( :( :( :( :( :( :( :( :( :( :( :( :( :( :( :( 5 ((:( :( :( :( :( :( :( (:( : (/// 121 102 175 131 46 264 86 122 2 5 /// ÍS ///// 106 205 68 207 258 226 132 189 /////// ií ///; / : (: (: (: (: (: (: (: (: (: (: (((:( :( :( :( 1 (6 (:( :( :( :( :( :( :( : (((((( :( :( :( :(: 109 328 132 220 266 346 96 215 1 111 250 7 203 167 35 37 4 :( :( :( :( :( :( :( :( :( :( :( :( :( :( :(: 20 (:( :( :( :( :( :( :( 131 213 283 50 9 143 42 65
Petition 870190112922, of 11/05/2019, p. 75/110
37/54
2 185 328 80 31 220 213 21 225 ////////// l / i ////// 171 97 103 106 18 109 199 216 /////// 4 ///////; 63 332 280 176 133 302 180 151 ////////// 41 ///// 0 0 0 0 0 0 0 0 /////// I: /////// 117 256 38 180 243 111 4 236 /////////////////THE/:///////: /////// 64 30 177 53 72 280 44 25 ///////: 6 ///////: 93 161 227 186 202 265 149 117 //////////////// il ///////: /////// 142 11 20 0 189 157 58 47 5347434 229 267 202 95 218 128 48 179 22 //////////////// li ///////: /////// 188 233 55 3 72 236 130 126 / 4448444 177 160 200 153 63 237 38 92 //////////////// il ///////: 158 22 316 148 257 113 131 178 /// 448/444 95 63 71 177 0 294 122 24 ///////////: //// 44 ///////: 0 0 0 0 0 0 0 0 10 39 129 106 70 3 127 195 68 /////////////////1/////////: 156 24 249 88 180 18 45 185 13 142 200 295 77 74 110 155 6 //////////////://2/:///////: 147 89 50 203 0 6 18 127 14 225 88 283 214 229 286 28 101 23 //////////////// il ///////: 170 61 133 168 0 181 132 117 15 225 53 301 77 0 125 85 33 //////////////// Íl ///// 152 27 105 122 165 304 100 199 ////// 37 ////// 245 131 184 198 216 131 47 96 /////////////// /////////////// Í5 /: ////// ////// 0 0 0 0 0 0 0 0 ; ///// ® ///// 205 240 246 117 269 163 179 125 /////////////// ///////////////// 0 ///////// 111 112 298 289 49 236 38 9 32 19 251 205 230 223 200 210 42 67 ///////////////// 3 ///////// /////// 86 158 280 157 199 170 125 178 20 117 13 276 90 234 7 66 ²³⁰ 24 ///////////////// 4 /: /////// /////// 236 235 110 64 0 249 191 2 24 0 0 0 0 0 0 0 0 ²⁴ //////////////// 1/1 //////// 116 339 187 193 266 288 28 156 25 0 0 0 0 0 0 0 0 /////////////// 12 /: ////// 222 234 281 124 0 194 6 58 3 1 /// 11Ü11111 121 276 220 201 187 97 4 128 /////////////// IS: /////// 0 0 0 0 0 0 0 0 //////// Ü //////// 89 87 208 18 145 94 6 23 /////////////////1/://////// 23 72 172 1 205 279 4 27 /////// ^ ///////: 84 0 30 165 166 49 33 162 ///////////////// 6 ///////// 136 17 295 166 0 255 74 141 ////: / 4 ///// 20 275 197 5 108 279 113 220 25 ////////////1///// 116 383 96 65 0 111 16 11 : /////// 8 /: ////// 150 199 61 45 82 139 49 43 //////////////// ii ///////: ////// 182 312 46 81 183 54 28 181 : /////// 7 /: ////// 131 153 175 142 132 166 21 186 //////////////////// //////////: ///// 47 ///////: /////// 0 0 0 0 0 0 0 0 : /////// 8 /: ////// 243 56 79 16 197 91 6 96 //////////////////// /////////////////THE////////: /////// 195 71 270 107 0 325 21 163 10 136 132 281 34 41 106 151 1 ///////////////// I ////////: 243 81 110 176 0 326 142 131 : ////// l / Í /////// 86 305 303 155 162 246 83 216 26 /////////////: /// 4 ////////: 215 76 318 212 0 226 192 169 12 246 231 253 213 57 345 154 22 //////////////// il ///////: 61 136 67 127 277 99 197 98 13 219 341 164 147 36 269 87 24 /////////: ////// 48 ///////: 0 0 0 0 0 0 0 0 14 211 212 53 69 115 185 5 167 /////////////////1/////////: 25 194 210 208 45 91 98 165 16 240 304 44 96 242 249 92 200 //////////// ^^ /////: /////////////////is///////// 104 194 29 141 36 326 140 232 14417444: 76 300 28 74 165 215 173 32 1/1 /// 11 //: / /////////////////The///////// 194 101 304 174 72 268 22 9 :: ///// 3Í /: /: / :: 244 271 77 99 0 143 120 235 /////////////// /////////////// Í9 /: ////// ////// 0 0 0 0 0 0 0 0 20 144 39 319 30 113 121 2 172 /////////////// /////////////////The///////// ////// 128 222 11 146 275 102 4 32 :: /////: 21 //////: 12 357 68 158 108 121 142 219 ///////////////// 4 /: /////// /////// 165 19 293 153 0 1 1 43 :: ///// 22 //////: 1 1 1 1 1 1 0 1 28 //////////////// 1: 8 /: ////// 181 244 50 217 155 40 40 200 25 0 0 0 0 0 0 0 0 /////////////// 14 /: ////// 63 274 234 114 62 167 93 205 4 : /: ////: / £) ///////: 157 332 233 170 246 42 24 64 /////////////// 18 /: ////// 0 0 0 0 0 0 0 0 //////// I: ///////: 102 181 205 10 235 256 204 211 /////////////////1/://////// 86 252 27 150 0 273 92 232 26 0 0 0 0 0 0 0 0 //////////////// ii /: ////// 236 5 308 11 180 104 136 32 llllllll /////1///// 205 195 83 164 261 219 185 2 29 //////////////// 1/1 //////// 84 147 117 53 0 243 106 118 //////// I //////// 236 14 292 59 181 130 100 171 //////////: ///// 21 ///////: /////// 6 78 29 68 42 107 6 103 : /////// 3: / 444 194 115 50 86 72 251 24 47 /////////////// /////////////// ll ///////: /////// 0 0 0 0 0 0 0 0 12 231 166 318 80 283 322 65 143 //////////////////////; ///////////////// 0 ////////: 111 216 159 91 34 0 171 2 170 ////// IS /: ///// 28 241 201 182 254 295 207 210/11111 | // 1 //////////////// il ///////: /////// 73 229 23 130 90 16 88 199 : ////// 21 /////// 123 51 267 130 79 258 161 180 /////////// ii /// //////////////// il ///////: 120 260 105 210 252 95 112 26 22 115 157 279 153 144 283 72 180 ////////: /////// 24 ///////: 9 90 135 123 173 212 20 105
Petition 870190112922, of 11/05/2019, p. 76/110
38/54
27 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 6 sSSSSssss 183 278 289 158 80 294 6 199 ssssssssiSSSís 95 100 222 175 144 101 4 7322 257 21 119 144 73 27 22i %%% 177 215 308 49 144 297 49 14928 1 293 113 169 330 163 23%%% i 172 258 66 177 166 279 125 17567 351 13 21 90 99 50 100® + ®i 61 256 162 128 19 222 194 108 / iiisísiiiiií 244 92 232 63 59 172 48 920 0 0 0 0 0 0 0 / iiiiaYiiiiií 11 253 302 51 177 150 24 207221 102 210 192 0 351 6 103 18 157 18 138 136 151 284 38 52112 201 22 209 211 265 126 110 20 211 225 235 116 108 305 91 13 32199 175 271 58 36 338 63 151 28 0 0 0 0 0 0 0 0121 287 217 30 162 83 20 211 lllillil ssssisssí 220 9 12 17 169 3 145 77 : ®®®®®®®14 +++ s 0 0 0 0 0 0 0 044 62 88 76 189 103 88 146 hhhhhhhhhhhhhhhhhíhhhhhhhhh %%% i 2 323 170 114 0 56 10 199159 316 207 104 154 224 112 209 hhhhhhhhhhhhhhhhhBhhhhhhhhh ; %%%: 187 8 20 49 0 304 30 13231 333 50 100 184 297 153 32 ....................... 33 ........... hhhhhhhhhhhhhhhhídhhhhhhhh ; %%%: 41 361 140 161 76 141 6 172167 290 25 150 104 215 159 166 hhhhhhhhhhhhhhh ^ Bbbbbbbb 11 211 105 33 137 18 101 92 65 14 104 114 76 158 164 39 76 180 0 0 0 0 0 0 0 29 0 0 0 0 0 0 0 0 bbbbbbbbbbbbbbbbbQbbbbbbbbb 127 230 187 82 197 60 4 161 8112 307 295 33 54 348 172 181 hhhhhhhhhhhhhhhhh ^ hbbbbbbb 167 148 296 186 0 320 153 2374 179 133 95 0 75 2 105 34164 202 5 68 108 112 197 1427 165 130 4 252 22 131 141 hhhhhhhhhhhhhhhi ^ bbbbbbb 159 312 44 150 0 54 155 180 12 211 18 231 217 41 312 141 223 ssssssssãgSíss 0 0 0 0 0 0 0 0102 39 296 204 98 224 96 17711 161 320 207 192 199 100 4 231 19 164 224 110 39 46 17 99 145 / ííííííííííiisliiíiiiis iili 197 335 158 173 278 210 45 174 / iiííiziiiiiii 109 368 269 58 15 59 101 199 ....................... 35 ........... hhhhhhhhhhhhhhhdshhhhhhz iili 207 2 55 26 0 195 168 145 22 241 67 245 44 230 314 35 153 ®®®®®®®] 22 %% í%: 103 266 285 187 205 268 185 10090 170 154 201 54 244 116 38 %%%%%%% ®57 %% í%: 0 0 0 0 0 0 0 0 30 0 0 0 0 0 0 0 037 210 259 222 216 135 6 11 9103 366 189 9 162 156 6 169 %%%%%%%% í: 4% í %%: 105 313 179 157 16 15 200 207 / iiiiidiiiiiiií 182 232 244 37 159 88 10 12 36 %%%%%%%% í: 5% %%%: 51 297 178 0 0 35 177 42 syllable 109 321 36 213 93 293 145 206 SSSSSSSSiSssss 120 21 160 6 0 188 43 100 isssfisssí 21 133 286 105 134 111 53 221 SSSSSSSíggssss 0 0 0 0 0 0 0 0142 57 151 89 45 92 201 17 hhhhhhhhhhhhhhhhhíhhhhhhhhh lil 198 269 298 81 72 319 82 5914 303 267 185 132 152 4 212 hhhhhhhhhhhhhhhhTShhhhhhhh lil 220 82 15 195 144 236 2 20461 63 135 109 76 23 164 92 hhhhhhhhhhhhhhh! a3hhhhhhhh lil 122 115 115 138 0 85 135 161 20 216 82 209 218 209 337 173 2050 0 0 0 0 0 0 00 0 0 0 0 0 0 0 bbbbbbbbbbbbbbbbbQbbbbbbbbb 167 185 151 123 190 164 91 121 lllllllll98 101 14 82 178 175 126 116 bbbbbbbbbbbbbbbbbébbbbbbbbb 151 177 179 90 0 196 64 90149 339 80 165 1 253 77 151 38157 289 64 73 0 209 198 26167 274 211 174 28 27 156 70163 214 181 10 0 246 100 140 siSSVsssii 160 111 75 19 267 231 16 230 SSSSSSSS6ÍSSÍS 0 0 0 0 0 0 0 0 / iiiistiiiiiii 49 383 161 194 234 49 12 115iili 173 258 102 12 153 236 4 11558 354 311 103 201 267 70 84iili 139 93 77 77 0 264 28 188 32 0 0 0 0 0 0 0 0 39 ®®®®®®®®ΐΐ: ®®®® iili 149 346 192 49 165 37 109 168 llllilll / iiiisliiiiiii 77 48 16 52 55 25 184 45 %%%%%%%% í: s% í %%: iili 0 297 208 114 117 272 188 52 / iiiiíBiiiiiiii 41 102 147 11 23 322 194 115 %%%%%%% ®6 %%%%% 0 0 0 0 0 0 0 0 12 83 8 290 2 274 200 123 134 %%%%%%%% :: 0%; %%%: 157 175 32 67 216 304 10 4
Petition 870190112922, of 11/05/2019, p. 77/110
39/54
16 182 47 289 35 181 351 16 1 ; ////////////////; &//////;;;;; 137 37 80 45 144 237 84 103 ////// 21 /////// 78 188 177 32 273 166 104 152 40 ; /////////////// ÍB / ;;;;;;;;;;;; 149 312 197 96 2 135 12 30 22 252 334 43 84 39 338 109 165 //////////////////////; ///////////////;THE/////// ///////; 0 0 0 0 0 0 0 022 115 280 201 26 192 124 107 //////////////////////; ///////////////// 19999 / ///////; 167 52 154 23 0 123 2 53 33 0 0 0 0 0 0 0 0 ///////////////// 3 ///////// ///////; 173 314 47 215 0 77 75 189///////; 0 /////; 9 160 77 229 142 225 123 6 186 /////////// 11999 ///////////////// 9 ///////// 139 139 124 60 0 25 142 215 ////////1//////// 42 186 235 175 162 217 20 215 //////////////// i® /////// 151 288 207 167 183 272 128 24 10 21 174 169 136 244 142 203 124 ///////////////: 03 /////// 0 0 0 0 0 0 0 0 ////// 11 //////; 32 232 48 3 151 110 153 180 ///////////////// 0 ///////// 149 113 226 114 27 288 163 222 13 234 50 105 28 238 176 104 θθ 4.9157 14 65 91 0 83 10 170 18 7 74 52 182 243 76 207 80 ⁴² /////////////// 21 /////// 137 218 126 78 35 17 162 71 34 0 0 0 0 0 0 0 0: /////// 0 0 0 0 0 0 0 0 iiiliiii ; /////// 0; /////// 177 313 39 81 231 311 52 220 //////////////////////; : //////////////: 91: 9999 : 99 /// 151 113 228 206 52 210 1 22 : /////// 3: /////// 248 177 302 56 0 251 147 185 : /////////////// 18 ///////: : /////// 163 132 69 22 243 3 163 127 ; /////// 7; /////// 151 266 303 72 216 265 1 154 43 : /////////////// 18 ///////: : /////// 173 114 176 134 0 53 99 49 : ////// 20: ////// 185 115 160 217 47 94 16 178 : /////////////// 28 ///////: 139 168 102 161 270 167 98 125 23 62 370 37 78 36 81 46 150 : /////////////// 0δ /////; 9 0 0 0 0 0 0 0 0 35 0 0 0 0 0 0 0 0 : ////////////////: 09999 / 139 80 234 84 18 79 4 191 lllillll 599/0999 / 206 142 78 14 0 22 1 124 : ///////////////; Í ////////; 157 78 227 4 0 244 6 211 12 55 248 299 175 186 322 202 144 44 : ////////////////; 9: //////; 9 163 163 259 9 0 293 142 187 15 206 137 54 211 253 277 118 182 ; /////////////// 2nd ///////; 173 274 260 12 57 272 3 148 16 127 89 61 191 16 156 130 95 //////////////////////; ///////; //////// 88; /////// ///////; 0 0 0 0 0 0 0 0 ////// 1; 7 //////; 16 347 179 51 0 66 1 72 //////////////////////; ////////////////// i: ///////// ///////; 149 135 101 184 168 82 181 177 ////// 21 /////// 229 12 258 43 79 78 2 76 Ι ///////// ϊ << 9 //// ///////////////// 6 ///////// ///////; 151 149 228 121 0 67 45 114 36 0 0 0 0 0 0 0 0 ⁴⁵ ///////////////// 1: 0: /////// 167 15 126 29 144 235 153 93 9999/959999 / 999/0999: / 40 241 229 90 170 176 173 39 ////////////// iel /////// 0 0 0 0 0 0 0 0
Table 1
Petition 870190112922, of 11/05/2019, p. 78/110
40/54
|H _{l) (i} i llllllllllllli ]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]] ehBiSé] BS] is ^ hj / íõhiS] ^^ |]]]]]]] ]]]]]]]]]]]]]]]]]]]]]]]]]]]]] queue index i iiiiiiiiiii | èdíti | g | iiiiiiiii ]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]: ÍBáí ^ iiâiíiiiÓShÍ / lhfÓiií | [| iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii iiiii iiiii iiiiii iiiiiii iiiiiii iiiiiii iiiiiii iiiiii iiiiiiiiiii iiiiiiiiiiii iiiiiiiiiii iiiiiii iiiiii iiiiii iiiiiii iiii Illllllllllli iiiiiiiiiiiiiiiiiOiiiiiiiiiiiiiiiii 9 174 0 72 3 156 143 145 16 Iii / Biiiiii 0 0 0 0 0 0 0 0 //////// Í //////// Í 117 97 0 110 26 143 19 131 | / ii | iiiiiiiiiiiiii; 254 158 0 48 120 134 57 196 iiiiiiiiiiiiiiiii2iiiiiiiiiiiiiiiiiii 204 166 0 23 53 14 176 71 iiiii / Siiiiiiii 124 23 24 132 43 23 201 173 //////// Í3 //////// Í 26 66 0 181 35 3 165 21 ]]]] / iB]] /] / 114 9 109 206 65 62 142 195 //////// ÍS //////// Í 189 71 0 95 115 40 196 23 iiiiiiiii; 64 6 18 2 42 163 35 218 iiiiiiiiiiiiiiiii9iiiiiiiiiiiiiiiiiii 205 172 0 8 127 123 13 112 iiiiiiiiiii 0 0 0 0 0 0 0 0 ////////BI 0 0 0 1 0 0 0 1 Iiiiii ]]]]]] / 0 /] /] / 220 186 0 68 17 173 129 128 //////// ÍÍ /////// Í 0 0 0 0 0 0 0 0 iiiiiiiSiiiiiii; 194 6 18 16 106 31 203 211iiiiiiiiiiiiiiiiioiiiiiiiiiiiiiiiiiii 167 27 137 53 19 17 18 142 iiiiiiiiiiiiii / 50 46 86 156 142 22 140 210 //////// Í3 //////// Í 166 36 124 156 94 65 27 174 23 0 0 0 0 0 0 0 0 iiiiiiiiiiiiiiiii / iiiiiiiiiiiiiiiii 253 48 0 115 104 63 3 183 Iiiiii /// io //]] 87 58 0 35 79 13 110 39 iiiiiiiiiiiiiiiiièiiiiiiiiiiiiiiiiiii 125 92 0 156 66 1 102 27 iiiiii] //]]] 20 42 158 138 28 135 124 84 //////// Í6 //////// Í 226 31 88 115 84 55 185 96 iiiiiiBiiiiii 185 156 154 86 41 145 52 88 //////// i ///// ^ /// 156 187 0 200 98 37 17 23 29 0 0 0 0 0 0 0 0 iiiiiiiiiiiiiiiiiOiiiiiiiiiiiiiiiii 224 185 0 29 69 171 14 9 20 iiiiiii / iiiiiiii 26 76 0 6 2 128 196 117 //////// Í9 //////// Í 252 3 55 31 50 133 180 167 iiiiiiiiiiiiii 105 61 148 20 103 52 35 227 iiiiiiiiiiiiiiiilfiiiiiiiiiiiiiii 0 0 0 0 0 0 0 0 iiiiiiii / iiiii] 29 153 104 141 78 173 114 6 iiiiiiiiiiiiiiii / liiiiiiiiiiiiiii 0 0 0 0 0 0 0 0 iiiiiitiiii] 0 0 0 0 0 0 0 0 2 íííííííííííí;; 81 25 20 152 95 98 126 74 iiiiiüi iiiiiiiOiiiiiiii 76 157 0 80 91 156 10 238 iiiiiiiiiiiiiiiii / iiiiiiiiiiiiiiiii 114 114 94 131 106 168 163 31 iiiiiiisiiiiii] 42 175 17 43 75 166 122 13 //////// ÍI ///// Í // Í 44 117 99 46 92 107 47 3 iiiiiiiiiiiiii 210 67 33 81 81 40 23 11 ] iiiiiiiiiiiiiiii | iiiiiiiiiiiiiiii; 52 110 9 191 110 82 183 53 iiiiiiiiiiiiii 0 0 0 0 0 0 0 0 iiiiiiiiiiiiiiiiâiiiiiiiiiiiiiiiiii 240 114 108 91 111 142 132 155 22 iiiiiiiiiiiiii] 222 20 0 49 54 18 202 1951 1 1 0 1 1 1 0 iiiiiiiiiiiiii 63 52 4 1 132 163 126 44 iiiiiiiiiiiiiiiiíliiiiiiiiiiiiiii; 0 0 0 0 0 0 0 0 iiiiiiiiiiiiii 0 0 0 0 0 0 0 0 iiiiiiiiiiiiiiiilsiiiiiiiiiiiiiiiiii 0 0 0 0 0 0 0 0 23 iiiiiiiiiiiiii 23 106 0 156 68 110 52 5 3 iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii 8 136 38 185 120 53 36 239 iiiiiiiiiiiiii] 235 86 75 54 115 132 170 94 iiiiiiiiiiiiiiiiiliiiiiiiiiiiiiiii; 58 175 15 6 121 174 48 171 iiiiiiiSiiiiiiii 238 95 158 134 56 150 13 111158 113 102 36 22 174 18 95 iiiiiiiiiii] 0 0 0 0 0 0 0 0 iiiiiiiiiiiiiiiiiSiiiiiiiiiiiiiiii; 104 72 146 124 4 127 111 110 24 iiiiiii / íiiiiii 46 182 0 153 30 113 113 81 ////////] 8 /////// i] 209 123 12 124 73 17 203 159 iiiiiiiii] 139 153 69 88 42 108 161 19 iiiiiiiiiiiiiiiii / iiiiiiiiiiiiiiiii 54 118 57 110 49 89 3 199 iiiiiiiii]]]]] 8 64 87 63 101 61 88 13018 28 53 156 128 17 191 43 34 0 0 0 0 0 0 0 0 Íiiiiiiiiiiiiiii9Íiiiiiiiiiiiiiii 128 186 46 133 79 105 160 75 25 iiiiiiiiiiiiii 228 45 0 211 128 72 197 66 ]]]]]]]]]]]]]]] ÍB /]]]]]]]]]]]]]]]]]] 0 0 0 1 0 0 0 1 iiiiiiiiiiiiii 156 21 65 94 63 136 194 95 ]]]]]]]]]]]]]]]]] T3]]]]]]]]]]]]]]]]] i 0 0 0 0 0 0 0 0 35 0 0 0 0 0 0 0 0
Petition 870190112922, of 11/05/2019, p. 79/110
41/54
4 //////// 0 ////// :: 179 72 0 200 42 86 43 29 26 /// 2/ // 29 67 0 90 142 36 164 146214 74 136 16 24 67 27 140 /// ^ /// i 143 137 100 6 28 38 172 66 //////// if ///// :: 71 29 157 101 51 83 117 180 ////2/// 160 55 13 221 100 53 49 1900 0 0 0 0 0 0 0 /// ii /// 122 85 7 6 133 145 161 86 Illllllllllli231 10 0 185 40 79 136 121 /// 11 /// 0 0 0 0 0 0 0 041 44 131 138 140 84 49 41 llllillll /// 0 / // 8 103 0 27 13 42 168 64194 121 142 170 84 35 36 169 /// Í /// Í 151 50 32 118 10 104 193 181159 80 141 219 137 103 132 88 /// ii /// 0 0 0 0 0 0 0 0103 48 64 193 71 60 62 207 28 /// i /// i 98 70 0 216 106 64 14 70 0 0 0 0 0 0 0 Í /// 2 /// Í 101 111 126 212 77 24 186 144 6155 129 0 123 109 47 7 137 /// Í5 /// Í 135 168 110 193 43 149 46 16228 92 124 55 87 154 34 72 /// 38 /// 0 0 0 0 0 0 0 045 100 99 31 107 10 198 172 29 /// ÍÈ5 /// Í 18 110 0 108 133 139 50 2528 49 45 222 133 155 168 124 /// 4 / // 28 17 154 61 25 161 27 57 ///// Iii ////// 158 184 148 209 139 29 12 56 :::::: 0 :::::: 0 0 0 0 0 0 0 0 ///// li® /////: / 0 0 0 0 0 0 0 0 l / lill /// Í2 71 120 0 106 87 84 70 37 llllillll129 80 0 103 97 48 163 86 /// 5 / // 240 154 35 44 56 173 17 139147 186 45 13 135 125 78 186 ::::::::1::::::: 9 52 51 185 104 93 50 221140 16 148 105 35 24 143 87 /// Í9 /// Í 84 56 134 176 70 29 6 173 102 96 150 108 47 107 172 /// li /// 0 0 0 0 0 0 0 0 ////// ii ////// 116 143 78 181 65 55 58 154 llllillll /// i /// i 106 3 0 147 80 117 115 201 ////////SAW 0 0 0 0 0 0 0 0 //// 3 /// 1 170 20 182 139 148 189 46 8 ::::::::::::::::: 0 :::::::::::::::::: 142 118 0 147 70 53 101 176 /// 4 //// 0 0 0 0 0 0 0 0 //////// Í //////// Í 94 70 65 43 69 31 177 169 32 /// i /// 242 84 0 108 32 116 110 179 //////// 12 /////// Í 230 152 87 152 88 161 22 225 /// Í5 /// Í 44 8 20 21 89 73 0 14 //////// 18 /////// 0 0 0 0 0 0 0 0 ////2/// 166 17 122 110 71 142 163 116 9 //////// Í //////// Í 203 28 0 2 97 104 186 167 ///B/// 0 0 0 0 0 0 0 0 //////// Í8 //////// Í 205 132 97 30 40 142 27 238 33 /// iã /// 132 165 0 71 135 105 163 46 //////// 18 /////// 61 185 51 184 24 99 205 48 /// //// 164 179 88 12 6 137 173 2 //////// 11 /////// Í 247 178 85 83 49 64 81 68 /// ii /// 235 124 13 109 2 29 179 106 //////// 1Í /////// Í 0 0 0 0 0 0 0 0 /// ii /// 0 0 0 0 0 0 0 0 Illllllllllli ////////: i ////// i / 11 59 0 174 46 111 125 38 34 /// 0 / // 147 173 0 29 37 11 197 184 ///////////////// 185 104 17 150 41 25 60 217 /// 12 /// 85 177 19 201 25 41 191 135 //////// 0 //////// 0 22 156 8 101 174 177 208 // iii /// 36 12 78 69 114 162 193 141 //////// 7 ////// Í / 117 52 20 56 96 23 51 232 iiiiiiOiiiiii 0 0 0 0 0 0 0 0 /////// 2δ /////// ί 0 0 0 0 0 0 0 0 35 iiiiiiiiiiiiii 57 77 0 91 60 126 157 85 llllillll! //////// 8 /////// i 11 32 0 99 28 91 39 178 iiiiii5 iiiiii 40 184 157 165 137 152 167 225 //////// Í /////// Í 236 92 7 138 30 175 29 214 iiiiiiiíiiiiiii 63 18 6 55 93 172 181 175 9 210 174 4 110 116 24 35 168 iiiiii45ÍÍ 0 0 0 0 0 0 0 0 //////// 13 /////// 56 154 2 99 64 141 8 51 36 iiiiiii iiiii 140 25 0 1 121 73 197 178 ///////: ii /////// 0 0 0 0 0 0 0 0 /// ii ///: 38 151 63 175 129 154 167 112
Petition 870190112922, of 11/05/2019, p. 80/110
42/54
12 I: /: /: /: /:!: /: /: /: /: // 63 39 0 46 33 122 18 124:::::::1:::::::: 154 170 82 83 26 129 179 106 //////// ia //////: // 111 93 113 217 122 11 155 122 :::::: 46 /// 0 0 0 0 0 0 0 0 //////// ii //////// 14 11 48 109 131 4 49 72 iiiiii ::::::: 11 :::::: 219 37 0 40 97 167 181 154 ::::::::::::::: 12 ::::::::::::::: 0 0 0 0 0 0 0 0 /// ii :: // 151 31 144 12 56 38 193 114 Illlllllllli :::::::::::::::/1/////:::::: 83 49 0 37 76 29 32 48 :::::: 41 ::::: 0 0 0 0 0 0 0 0 /////////////// :: // 2 125 112 113 37 91 53 57 38 ///1////: 31 84 0 37 1 112 157 42 :::::::::::::::::: s ::::::::::::::::: 38 35 102 143 62 27 95 167 :::::::1:::::/ 66 151 93 97 70 7 173 41 //////// ii ///// ::::: 222 166 26 140 47 127 186 219 :::::: 11: /// 38 190 19 46 1 19 191 105 ::::::::::::::: 13 :::::::::::::::: 0 0 0 0 0 0 0 0 /// 48 // :: 0 0 0 0 0 0 0 0 14 ////////1////////] 115 19 0 36 143 11 91 82 39 ::::::1//:/ 239 93 0 106 119 109 181 167 :::::::::::::::::1/////:::::: 145 118 138 95 51 145 20 232 :::::/1//:/ 172 132 24 181 32 6 157 45 :::::::::::::::: 1: 1 ::::::::::::::::: 3 21 57 40 130 8 52 204 //: 11 :::::: 34 57 138 154 142 105 173 189 //////// isi /////// 232 163 27 116 97 166 109 162 :::::: 49 /// 0 0 0 0 0 0 0 0 ::::::::::::::: 24 :::::::::::::::: 0 0 0 0 0 0 0 0 40 ///1///:: 0 103 0 98 6 160 193 78 Illlllllllli ////////: 0 ///// ::::::: 51 68 0 116 139 137 174 38 :::::: 1: 1 :::::: 75 107 36 35 73 156 163 67 //////// iii /////// 175 63 73 200 96 103 108 217 :::::: «// 120 163 143 36 102 82 179 180 :::::::::::::::: 1: 1 ::::::::::::::::: 213 81 99 110 128 40 102 157 /// il :::::: 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 Iiiiii /// I ////: 129 147 0 120 48 132 191 53 16 ::::::::::::::::1::::::::::::::::: 203 87 0 75 48 78 125 170 /// i: /// 229 7 2 101 47 6 197 215 :::::::::::::::::1:::::::::::::::: 142 177 79 158 9 158 31 23 ::::::: 11 ///: 118 60 55 81 19 8 167 230 ::::::::::::::: 1: 1 ::::::::::::::::: 8 135 111 134 28 17 54 175 ............ 51 .............. 0 0 0 0 0 0 0 0 :::::::::::::::: 11 ::::::::::::::: 242 64 143 97 8 165 176 202
Table 2
Petition 870190112922, of 11/05/2019, p. 81/110
43/54
[0075] A UE or a base station can be configured with rules for the selection of base graph 1 or 2. In a configuration, if CBS <292, or CBS d 3824 and CR d 0.67, or if CR d 0, 25, the LDPC 2 base chart should be used. Otherwise, the base LDPC 1 chart is used.
[0076] In one aspect, when the base LDPC graph 2 is used in combination with the selection of Kb being 10, the elevation factor Z can limit the performance of LDPC QC codes. Several configurations described below include different rules to solve this problem and further improve the performance of the LDPC QC code.
[0077] In some configurations, the selection of the LDPC 1 or 2 base graph can be performed based on the CBS and CR values. Typically, the LDPC 1 base chart performs better than the base 2 chart with higher CR values and higher CBS values. The LDPC 2 base chart performs better than the base 1 chart with lower CR values and lower CBS values. In certain configurations, the first base chart (LDPC base chart 1) can be used for the initial transmission and subsequent retransmissions of the same transport block if: 1) CBS> 3840 or if 2) CR value of the initial transmission> 0.67 . In certain configurations, the second base graphic (LDPC base graphic 2) can be used for the initial transmission and subsequent retransmissions of the same transport block if: 1) CBS d 3840 and if 2) CR value of the initial transmission d 0.67 .
[0078] In addition, once a specific base chart is selected, the technique below can be used to determine an ideal Kb number. For example, when the CBS varies between 40 and 656, the UE or the base station can be configured to use a
Petition 870190112922, of 11/05/2019, p. 82/110
44/54 Kb number in the range of 5 to 10. An ideal number of Kb can be determined when a sum of the absolute values of SNR with a Block Error Rate (BLER) in a receiver is 10 ² and in which the BLER is 10 ⁴ at least with all candidate CRs and the value of Kb provided. For example, a specific Kb number (for example, Kb = 5) of numbers from candidates for Kb can be selected for a target CBS (for example, CBS = 40) to generate a cumulative sum of SNR measurements in which the BLER is 10 ⁴ and where the BLER is 10 ⁴ for all candidate CR values. In one configuration, the CR values used to determine an ideal Kb number can include 1/5, 1/3, 2/5, 1/2, 2/3. As such, the cumulative sum of SNR measurements for all candidate CR values in number Kb 5 is determined for the target CBS. Subsequently, another Kb number (for example, Kb = 6) of the numbers from the candidates for Kb can be selected, and the corresponding cumulative sum of the SNR values can be calculated. This process is repeated for the entire range of candidate Kb numbers (for example, 5 to 10). An ideal Kb number can be determined as the Kb number that produces the lowest cumulative sum of SNR measurements, as described above. This process of selecting an ideal Kb number can be described using the following equation (2):
O * ~ argmín V | S, 0 ^ _W -2 (CR, 0) 1 CR
[007 9] In one example, the ideal numbers of Kb for the base graph LDPC 2 for different CBSs are determined based on Equation (2). In particular, if CBS is greater than 640, the ideal Kb number will be 10. If CBS is not greater than 640 and greater than 560, the ideal Kb number will be 9. If CBS is not greater than 560 and
Petition 870190112922, of 11/05/2019, p. 83/110
45/54 is greater than 192, the ideal Kb number will be 8. If the CBS is not greater than 192, the ideal number of Kb is 6.
[0080] Figure 9 is a 900 flow chart of a method (process) for using improved QC-LDPC codes. The method can be carried out by a UE (e.g. UE 104, UE 350, apparatus 1002/1002 ') or by a base station (e.g. base station 102, base station 310, apparatus 1002/1002' ). It is worth mentioning that, although the description below is provided in the context of the EU (s), the description below is also applicable to the base station (s). In operation 902, the UE or base station determines a CBS of information bits contained in an LDPC encoding code word. As noted above, each LDPC code word includes a piece of information and a parity piece. Thus, in operation 902, the UE or base station determines the length of the information portion. In operation 904, the UE or base station compares the given CBS with at least a predefined limit as explained below. This comparison is performed to determine an ideal Kb number.
[0081] In operation 906, the UE or base station determines an ideal Kb number for the LDPC 2 base graphic using the following rules:
If CBS> 640, use Kb = 10
Otherwise if 640 b CBS> 560, use Kb = 9 Otherwise if 560> CBS> 192, use Kb = 8 Otherwise if CBS d 192, use Kb = 6.
[0082] In operation 907, the UE or base station determines a Kp number. The Kp number is determined based on the Kb number and the code rate.
[0083] In operation 908, the UE or base station generates an array
Petition 870190112922, of 11/05/2019, p. 84/110
46/54 parity check (for example, parity check matrix 812) of LDPC encoding using the determined ideal Kb number. As noted above, the 812 parity check matrix has two parts. A first portion 816 represents a portion of information bits and a second portion 818 represents a portion of parity bits. The parity check matrix 812 can also include at least one sub-matrix 814.
[0084] In operation 910, the UE or base station operates an LDPC encoder (for example, LDPC encoder 192 shown in Figure 1) or an LDPC decoder (for example, LDPC decoder 194) based on the parity check matrix (for example, example, the parity check matrix 812). In other words, LDPC encoding / decoding is performed by special purpose logic within the LDPC encoder / decoder circuit. This special use logic uses the generated parity check matrix.
[0085] In certain configurations, the at least one limit includes a first limit of 640 bits and the number Kb is determined to be 10 when the CBS is greater than the first limit.
[0086] In certain configurations, the at least one limit includes a first limit of 640 bits and the second limit of 560 bits and the number Kb is determined to be 9 when CBS is less than or equal to the first limit and is greater than the second limit.
[0087] In certain configurations, at least one limit includes a first limit of 560 bits and the second limit of 192 bits and the number Kb is determined to be 8 when CBS is less than or equal to the first limit and is greater than the second limit .
[0088] In certain configurations, the at least one limit
Petition 870190112922, of 11/05/2019, p. 85/110
47/54 includes a first limit of 192 bits and the number Kb is determined to be 6 when CBS is less than or equal to the first limit.
[0089] In certain configurations, the circular permutation matrices are located in the locations of the first matrix as indicated by an adopted base graph.
[0090] In certain configurations, a first base chart or a second base chart is selected to be the base chart adopted based on at least one CBS and an initial transmission code rate.
[0091] In certain configurations, the second base graphic is selected when the CBS is less than or equal to 3840 bits and the code rate is less than or equal to 0.67.
[00 92] Figure 10 is a conceptual data flow diagram 1000 that illustrates the data flow between different components / media in an exemplary apparatus 1002. Apparatus 1002 may be a UE or a base station. The apparatus 1002 includes a receiving component 1004, a PCM generating component 1006, an encoder 1012, a decoder 1008, a transmitting component 1010 and a data application 1014. If the apparatus 1002 is a UE the receiving component 1004 can receive signals 1062 from a base station 1050 and the transmitting component 1010 can send signals 1064 to the base station 1050. If the apparatus 1002 is a base station the receiving component 1004 can receive signals 1062 from an UE 1054 and the component from transmission 1010 can send 1064 signals to UE 1054.
[0093] In certain configurations, the generation component PCM 100 6 is preconfigured to determine a CBS of information bits contained in an LDPC coding codeword. In other words, the PCM generation component 1006 is pre
Petition 870190112922, of 11/05/2019, p. 86/110
48/54 configured to determine the length of information portion of an LDPC codeword. The PCM 1006 generation component compares the finished CBS with at least one limit.
[0094] Based on the result of the comparison made, the PCM generation component 1006 determines a Kb number. When the at least one limit includes only a limit of 640 bits and when the CBS is greater than 640 bits, the generation component PCM 1006 determines the number Kb as 10. When the CBS is compared to two different limits of 560 bits and 640 bits and when CBS is greater than 560 bits and CBS is less than or equal to 640 bits, the PCM generation component 1006 determines the number of KB as 9. When CBS is compared to two different limits of 192 bits and 560 bits and when CBS is greater than 192 bits and CBS is less than or equal to 560 bits, the PCM generation component 1006 determines the number of KB as 8. When the at least one limit includes only a limit of 192 bits and when the CBS is less than or equal to 192 bits, the PCM generation component 1006 determines the number Kb as 6.
[0095] In certain configurations, the PCM 1006 generation component selects a first base graphic or a second base graphic to be the base graphic adopted based on at least one determined CBS and an initial transmission code rate. When CBS is less than or equal to 3840 and the code rate is less than or equal to 0.67, the PCM generation component 1006 selects the second base chart to be the base chart adopted. The adopted base graph defines a structure of the parity check matrix. The PCM generation component 1006 generates a parity check matrix 1020 of the LDPC encoding using the base graph adopted and the determined Kb number. Based on the Kb number
Petition 870190112922, of 11/05/2019, p. 87/110
49/54 determined, the PCM 100 6 generation component uses all or only a selected portion of the base graph adopted to generate the parity check matrix. The selected portion consists of two parts with one part including a subset of the parity check matrix information columns and a second part including a subset of parity check matrix columns. The number of columns of information used by the selected part is the determined Kb number and the number of parity columns used by the selected part is a determined Kp number. A portion of information from the parity check matrix is formed by the number M of square matrices. M is equal to Kp * Kb. A total number of columns in the Kb number of square arrays is equal to a total number of CBS bits. One or more of the number M of square matrices are circular permutation matrices. The circular permutation matrices are located at the locations of the information portion of the parity check matrix as indicated by the adopted base graph.
[0096] In one aspect, encoder 1012 receives data bits 1022 from a data application 1014 and encodes data bits 1022 using a generator matrix derived from the parity check matrix 1020 generated by the PCM generation component 1006 to generate an LDPC code 1024. In certain configurations, encoder 1012 sends the generated LDPC code 1024 to transmission component 1010. In one aspect, decoder 1008 decodes an LDPC code 1025 received from receiving component 1004 to generate the data bits 1027. In certain configurations, the decoder 1008 can send the generated data bits 1027 to the data application 1014. In
Petition 870190112922, of 11/05/2019, p. 88/110
50/54 various configurations, the data application 1014 can generally be any application that facilitates the operations of an organization (or multiple affiliated organizations), and may include, without limitation, email server applications, file server applications , email applications, database applications, word processing applications, spreadsheet applications, financial applications, presentation applications, browser applications, mobile applications, entertainment applications, and so on.
[0097] Figure 11 is a diagram 1100 that illustrates an example of a hardware implementation for an apparatus 1002 'that employs a processing system 1114. Apparatus 1002' may be a UE or a base station. The 1114 processing system can be implemented with a bus architecture, usually represented by an 1124 bus. The 1124 bus can include any number of interconnecting buses and bridges depending on the specific application of the 1114 processing system and the general design restrictions. Bus 1124 connects multiple circuits including one or more processors and / or hardware components, represented by one or more processors 1104, the receiving component 1004, the PCM generation component 1006, the decoder 1008, the transmission component 1010, and encoder 1012, and a computer-readable medium / memory 1106. Bus 1124 can also connect several other circuits such as timing sources, peripherals, voltage regulators, and power management circuits, etc.
[0098] The processing system 1114 can be coupled to a transceiver 1110, which can be one or more of the transceivers
Petition 870190112922, of 11/05/2019, p. 89/110
51/54
354 if apparatus 1102 'is a UE or one or more transceivers 318 if apparatus 1102' is a base station. Transceiver 1110 is coupled to one or more antennas 1120, which can be communication antennas 352 if apparatus 1102 'is a UE or communication antennas 320 if apparatus 1102' is a base station.
[0099] Transceiver 1110 provides a means of communication with several other devices through a means of transmission. Transceiver 1110 receives a signal from one or more antennas 1120, extracts information from the received signal, and supplies the extracted information to the processing system 1114, specifically the receiving component 1004. In addition, transceiver 1110 receives information from from the processing system 1114, specifically the transmission component 1010, and based on the information received, it generates a signal to be applied to one or more antennas 1120.
[00100] Processing system 1114 includes one or more processors 1104 coupled to a computer-readable medium / memory 1106. One or more processors 1104 are responsible for general processing, including running the software stored in the computer-readable medium / memory 1106. The software, when run by one or more 1104 processors, causes the 1114 processing system to perform the various functions described above for any particular device. Computer-readable medium / memory 1106 can also be used to store data that is handled by one or more processors 1104 when running the software. The processing system 1114 further includes at least one of the receiving components 1004, the PCM generation component 1006, the decoder 1008, the transmission component 1010, and the
Petition 870190112922, of 11/05/2019, p. 90/110
52/54 encoder 1012. The components may be software components running on one or more processors 1104, resident / stored in the computer-readable medium / memory 110 6, one or more hardware components coupled to one or more processors 1104, or some combination of them. In one configuration, the processing system 1114 can be a component of the UE 350 and can include the 360 memory and / or at least one of the TX 368 processor, the RX 356 processor, and the communication processor 359. In another configuration, the Processing system 1114 may be a component of base station 310 and may include memory 376 and / or at least one of the TX 316 processor, the RX 370 processor, and the communication processor 375.
[00101] In one configuration, apparatus 1002 / apparatus 1002 'for wireless communication includes means for performing each of the operations of Figure 9. The means mentioned above may be one or more of the above-mentioned components of apparatus 1002 and / or the processing system 1114 of apparatus 1002 'configured to perform the functions recited by the means mentioned above.
[00102] As described above, processing system 1114 may include processor TX 368, processor RX 356, and communication processor 359 or may include processor TX 316, processor RX 370, and communication processor 375. As such, in a configuration, the aforementioned means may be the Processor TX 368, the Processor RX 356, and the communication processor 359 configured to perform the functions recited by the means mentioned above. In another configuration, the means mentioned above can be the TX 316 processor, the RX 370 processor and the 375 communication processor
Petition 870190112922, of 11/05/2019, p. 91/110
53/54 configured to perform the functions recited by the means mentioned above. It is understood that the specific order or hierarchy of blocks in the disclosed processes / flowcharts is an illustration of exemplary approaches. Based on the project's preferences, it is understood that the specific order or hierarchy of blocks in the processes / flowcharts can be reorganized. In addition, some blocks can be combined or omitted. The attached method claims present elements of the various blocks in a sample order and are not intended to be limited to the specific order or hierarchy presented.
[00103] The previous description is provided to allow any technician in the subject to practice the various aspects described here. Various changes in these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein can be applied to other aspects. Thus, the claims are not intended to be limited to the aspects shown here, but should be given the full scope consistent with the language claims, where the reference to an element in the singular is not intended to mean one and only one unless it is specifically indicated, but one or more. The word exemplary is used here to mean serving as an example, instance or illustration. Any aspect described here as exemplary should not necessarily be interpreted as preferred or advantageous over other aspects. Unless otherwise indicated, the term some refers to one or more. Combinations such as at least one from A, B or C, one or more from A, B or C, at least one from A, B and C, one or more from A, B, and C, and A, B, C, or any combination thereof includes any combination of A, B and / or C, and may
Petition 870190112922, of 11/05/2019, p. 92/110
54/54 include multiples of A, multiples of B, or multiples of C. Specifically, combinations such as at least one from A, B or C, one or more from A, B, or C, at least one from A, B, and C, one or more of A, B, and C, and A, B, C, or any combination thereof can be just A, just B, just C, A and B, A and C, B and C, or A and B and C, where these combinations may contain one or more members or members of A, B, or C. All structural and functional equivalents to the elements of the various aspects described throughout this disclosure that are known or later known to those skilled in the art in the subject are expressly incorporated herein by reference and must be covered by the claims. In addition, nothing disclosed in this document should be dedicated to the public, regardless of whether such disclosure is explicitly recited in the claims. The words module, mechanism, element, device and the like may not replace the word medium. As such, no claim element should be interpreted as a means function unless the element is expressly recited using the phrase means to.

权利要求:
Claims (12)
[1]
1. Wireless communication method of a user equipment (UE) or a base station, characterized by the fact that it comprises:
determining a code block size (CBS) of information bits contained in a low density parity check (LDPC) coding code word;
compare CBS with at least one limit;
determine, based on the result of the comparison, a Kb number;
determine a Kp number based on a code rate and the Kb number;
generate an LDPC encoding parity check matrix, a piece of information from the parity check matrix being a first matrix formed by the number M of second square matrices, M being equal to Kp multiplied by Kb, a total number of columns in the number Kb of second square matrices being equal to a total number of CBS bits, one or more matrices of the number M of second square matrices being circular permutation matrices; and operating an LDPC encoder or LDPC decoder based on the parity check matrix.
[2]
2. Method according to claim 1, characterized by the fact that the at least one limit includes a first limit of 640 bits, in which the number Kb is determined to be 10 when the CBS is greater than the first limit; or where the at least one limit includes a first 640-bit limit and the second 560-bit limit, where the number
Petition 870190112922, of 11/05/2019, p. 9/110
2/5
Kb is determined to be 9 when CBS is less than or equal to the first limit and is greater than the second limit; or where the at least one limit includes a first limit of 560 bits and the second limit of 192 bits, where the number Kb is determined to be 8 when CBS is less than or equal to the first limit and is greater than the second limit; or where the at least one limit includes a first 192-bit limit, where the Kb number is determined to be 6 when CBS is less than or equal to the first limit.
[3]
3. Method, according to claim 1, characterized by the fact that the circular permutation matrices are located in the locations of the first matrix as indicated by an adopted base graph.
[4]
4. Method, according to claim 3, characterized by the fact that it further comprises: selecting a first base chart or a second base chart to be the base chart adopted based on at least one CBS and a transmission code rate initial.
[5]
5. Method, according to claim 4, characterized by the fact that the second base graphic is selected when the CBS is less than or equal to 3840 bits and the code rate is less than or equal to 0.67.
[6]
6. Device for wireless communication, characterized by the fact that it comprises:
a processor and a memory device attached to the processor, the memory device containing a set of instructions that, when executed by the processor, make the processor:
determine a code block size (CBS) of information bits contained in an encoding codeword
Petition 870190112922, of 11/05/2019, p. 10/110
3/5 low density parity check (LDPC);
compare CBS with at least one limit;
determine, based on the result of the comparison, a Kb number;
determine, based on a code rate and the Kb number, a Kp number;
generate an LDPC encoding parity check matrix, a piece of information from the parity check matrix being a first matrix formed by the number M of second square matrices, M being equal to Kp multiplied by Kb, a total number of columns in the number Kb of second square matrices being equal to a total number of CBS bits, one or more matrices of the number M of second square matrices being circular permutation matrices; and operating an LDPC encoder or LDPC decoder based on the parity check matrix.
[7]
7. Apparatus according to claim 6, characterized by the fact that the at least one limit includes a first limit of 640 bits, in which the number Kb is determined to be 10 when the CBS is greater than the first limit; or where the at least one limit includes a first limit of 640 bits and the second limit of 560 bits, where the number Kb is determined to be 9 when CBS is less than or equal to the first limit and is greater than the second limit; or where the at least one limit includes a first limit of 560 bits and the second limit of 192 bits, where the number Kb is determined to be 8 when CBS is less than or equal to the first limit and is greater than the second limit.
Petition 870190112922, of 11/05/2019, p. 11/110
4/5 where the limit of at least one includes a first limit of 192 bits, where the number Kb is determined to be 6 when CBS is less than or equal to the first limit.
[8]
8. Apparatus, according to claim 6, characterized by the fact that the circular permutation matrices are located in the locations of the first matrix as indicated by an adopted base graph.
[9]
9. Apparatus, according to claim 8, characterized by the fact that it also comprises: selecting a first base graphic or a second base graphic to be the base graphic adopted based on at least one CBS and a transmission code rate initial.
[10]
10. Apparatus, according to claim 9, characterized by the fact that the second base graphic is selected when the CBS is less than or equal to 3840 bits and the code rate is less than or equal to 0.67.
[11]
11. Tangible, non-transitory computer-readable media, characterized by the fact that it has software encoded in it, the software, when executed by a processor, operable for:
determining a code block size (CBS) of information bits contained in a low density parity check (LDPC) coding code word;
compare CBS with at least one limit;
determine, based on the result of the comparison, a Kb number;
determine a Kp number based on a code rate and the Kb number;
generate a parity check matrix of the
Petition 870190112922, of 11/05/2019, p. 12/110
5/5 LDPC encoding, a piece of information from the parity check matrix being formed by a number M of second square matrices, M being equal to Kp multiplied by Kb, a total number of columns in the number of second square matrices being equal a total number of CBS bits, one or more arrays of the number M of second square arrays being circular permutation arrays; and operating an LDPC encoder or LDPC decoder based on the parity check matrix.
[12]
12. Computer-readable media according to claim 11, characterized by the fact that the at least one limit includes a first 640-bit limit, where the Kb number is determined to be 10 when the CBS is greater than the first limit ; or where the at least one limit includes a first limit of 640 bits and the second limit of 560 bits, where the number Kb is determined to be 9 when CBS is less than or equal to the first limit and is greater than the second limit; or where the at least one limit includes a first limit of 560 bits and the second limit of 192 bits, where the number Kb is determined to be 8 when CBS is less than or equal to the first limit and is greater than the second limit.

类似技术:

---

公开号 | 公开日 | 专利标题

---

BR112019023198A2|2020-05-19|enhanced qc-ldpc codes

---

KR20190117544A|2019-10-16|Use of Synchronized Signal Block Indexes in New Radios

---

JP6896865B2|2021-06-30|Systems and methods for selecting or transmitting frequency domain patterns for phase tracking reference signals

---

US10103868B2|2018-10-16|Narrow band synchronization signal transmission and detection

---

RU2713479C2|2020-02-05|System and method for uplink narrow-band single-tone transmissions

---

KR102232096B1|2021-03-25|Narrowband Time Division Duplex Frame Structure for Narrowband Communications

---

BR112019016848A2|2020-04-07|sync signal blocks

---

BR112019017800A2|2020-03-31|STRUCTURE OF DIVISION TABLE DIVISION BY NARROW BAND TIME FOR NARROW BAND COMMUNICATIONS

---

BR112019019321A2|2020-04-14|scheduling request for one or more uplink transmissions using narrowband communications

---

BR112020009519A2|2020-11-03|physical layer enhancements for early data transmission

---

KR20200015901A|2020-02-13|Synchronization Signals for Broadcast Channels

---

BR112020006610A2|2020-10-06|methods and apparatus for device-to-device feedback

---

CN110063081A|2019-07-26|The public PDCCH design of group

---

KR101980031B1|2019-05-17|Uplink scheduling with power control command in an fdd half-duplex network

---

WO2018128901A1|2018-07-12|Low latency encoding and decoding of bit-reversed polar codes

---

KR20210124243A|2021-10-14|Techniques for supporting coexistence between two-step random access and four-step random access

---

BR112020002268A2|2020-07-28|methods and devices related to the demodulation reference signal design and related signaling

---

BR112019011118A2|2019-10-01|subfolder grouping confirmation

---

KR20190141167A|2019-12-23|Configurable In-Slot Frequency Hopping for Variable Length Uplink Control Channels

---

BR112020002964A2|2020-08-11|nprach having improved reliability performance

---

TWI755481B|2022-02-21|Single slot short pucch with support for intra slot frequency hopping

---

TWI754440B|2022-02-01|Narrowband time-division duplex frame structure for narrowband communications

---

TWI752165B|2022-01-11|Transmitting uplink control information

---

JP2021514139A|2021-06-03|Capability structure size-optimized coding for multi-carrier systems

同族专利:

---

公开号 | 公开日

---

CN109314527B|2021-10-26|

---

TWI702800B|2020-08-21|

---

CN109314527A|2019-02-05|

---

EP3602795A1|2020-02-05|

---

WO2018202143A1|2018-11-08|

---

US10659079B2|2020-05-19|

---

US20180323801A1|2018-11-08|

---

TW201902135A|2019-01-01|

---

CN113949389A|2022-01-18|

---

EP3602795A4|2020-06-03|

引用文献:

---

公开号 | 申请日 | 公开日 | 申请人 | 专利标题

---

---

WO2007106366A2|2006-03-10|2007-09-20|Interdigital Technology Corporation|Method and apparatus for scaling soft bits for decoding|

---

US8750358B2|2011-04-06|2014-06-10|Nec Laboratories America, Inc.|Method for improving multiuser MIMO downlink transmissions|

---

WO2013014923A1|2011-07-27|2013-01-31|パナソニック株式会社|Encoding method, decoding method|

---

JP6345949B2|2014-03-04|2018-06-20|株式会社Ｎｔｔドコモ|User terminal, radio base station, radio communication method, and radio communication system|

---

WO2017111559A1|2015-12-23|2017-06-29|Samsung Electronics Co., Ltd.|Apparatus and method for encoding and decoding channel in communication or broadcasting system|

---

US10749631B2|2016-03-29|2020-08-18|Lg Electronics Inc.|Method by which base station and terminal transmit and receive data signal in wireless communication system, and device for supporting same|

---

EP3264611A1|2016-05-12|2018-01-03|MediaTek Inc.|Qc-ldpc coding methods and apparatus|

---

US10567116B2|2017-05-12|2020-02-18|Mediatek Inc.|Wireless communication using codebooks from a QC-LDPC code for shorter processing latency and improved decoder throughput efficiency|

---

CN107370489B|2016-05-13|2020-07-28|中兴通讯股份有限公司|Data processing method and device for structured L DPC code|

---

US10425189B2|2016-07-29|2019-09-24|Lg Electronics Inc.|Method for processing data block in LDPC encoder|

---

US10608785B2|2017-01-19|2020-03-31|Qualcomm Incorporated|Resource-based code block segmentation|

---

WO2018174569A1|2017-03-22|2018-09-27|Samsung Electronics Co., Ltd.|Apparatus and method of transmission using harq in communication or broadcasting system|

---

JP6974493B2|2017-03-30|2021-12-01|エルジー エレクトロニクス インコーポレイティドLg Electronics Inc.|A method of encoding based on the parity check matrix of the LDPC code in a wireless communication system and a terminal using the same.|

---

CN109314527B|2017-05-05|2021-10-26|联发科技股份有限公司|QC-LDPC encoding method, apparatus and non-transitory computer readable medium|EP2525496A1|2011-05-18|2012-11-21|Panasonic Corporation|Bit-interleaved coding and modulationwith quasi-cyclic LDPC codes|

---

US10594339B2|2017-02-03|2020-03-17|Huawei Technologies Co., Ltd.|Method for generating parity check matrix for low density parity check coding|

---

US10735138B2|2017-05-02|2020-08-04|Futurewei Technologies, Inc.|Multi-label offset lifting method|

---

CN109314527B|2017-05-05|2021-10-26|联发科技股份有限公司|QC-LDPC encoding method, apparatus and non-transitory computer readable medium|

---

EP3588786A4|2017-06-15|2020-07-15|Huawei Technologies Co., Ltd.|Information processing method and communication apparatus|

---

CN109120374A|2017-06-26|2019-01-01|中兴通讯股份有限公司|Quasi-circulating low-density parity check code Design method and device|

---

CN109327225B9|2017-06-27|2021-12-10|华为技术有限公司|Information processing method and device and communication equipment|

---

CN110677157A|2017-06-27|2020-01-10|华为技术有限公司|Information processing method and device and communication equipment|

---

CN111327330A|2018-12-14|2020-06-23|深圳市中兴微电子技术有限公司|Information processing method, information processing equipment and computer storage medium|

---

CN110213019A|2019-05-28|2019-09-06|湖北三江航天险峰电子信息有限公司|A kind of PCM signal coded system and method|

---

WO2021195821A1|2020-03-30|2021-10-07|Qualcomm Incorporated|Communication configurations for low density parity checkcoding|

---

GB2595240A|2020-05-18|2021-11-24|Accelercomm Ltd|Low density parity check decoder, electronic device, and method therefor|

法律状态:
2021-10-19| B350| Update of information on the portal [chapter 15.35 patent gazette]|

优先权:

---

申请号 | 申请日 | 专利标题

---

US201762501953P| true| 2017-05-05|2017-05-05|

---

US201762517219P| true| 2017-06-09|2017-06-09|

---

US201762525243P| true| 2017-06-27|2017-06-27|

---

US201762525797P| true| 2017-06-28|2017-06-28|

---

PCT/CN2018/085648|WO2018202143A1|2017-05-05|2018-05-04|Improved qc-ldpc codes|

---